default search action

combined dblp search
author search
venue search
publication search

ask others

"On Sufficient Degree Conditions for a Graph to be k-linked."

Ken-ichi Kawarabayashi, Alexandr V. Kostochka, Gexin Yu (2006)

> Home

Details and statistics

DOI: 10.1017/S0963548305007479

access: closed

type: Journal Article

metadata version: 2020-03-12

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/cpc/KawarabayashiKY06
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/cpc/KawarabayashiKY06
Ken-ichi Kawarabayashi, Alexandr V. Kostochka, Gexin Yu:
On Sufficient Degree Conditions for a Graph to be k-linked. Comb. Probab. Comput. 15(5): 685-694 (2006)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.