✦ LIBER ✦

Hamiltonicity of 2-connected quasi-claw-free graphs

✍ Scribed by Rao Li

Book ID: 108113412
Publisher: Elsevier Science
Year: 2004
Tongue: English
Weight: 215 KB
Volume: 283
Category: Article
ISSN: 0012-365X
DOI: 10.1016/j.disc.2003.12.007

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Hamiltonicity of 2-connected claw-center

Hamiltonicity of 2-connected claw-center independent graphs

✍ Hao Li; Mei Lu; Feng Tian; Bing Wei 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 679 KB

In this paper, we give the following result: Let G be a 2-connected graph of order PZ> 13 and nd2az -3, where 02 = min{d(u) + d(u): uz'.$E(G)}. If the set of claw-centers of G is independent, then either G is hamiltonian or G belongs to three classes of exceptional graphs. The bound n <202 -3 is sha

Forbidden Subgraphs for Hamiltonicity of

Forbidden Subgraphs for Hamiltonicity of 3-Connected Claw-Free Graphs

✍ Jun Fujisawa 📂 Article 📅 2012 🏛 John Wiley and Sons 🌐 English ⚖ 572 KB

9-Connected Claw-Free Graphs Are Hamilto

9-Connected Claw-Free Graphs Are Hamilton-Connected

✍ Stephan Brandt 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 130 KB

A graph is Hamilton-connected if any pair of vertices is joined by a hamiltonian path. In this note it is shown that 9-connected graphs which contain no induced claw K 1, 3 are Hamilton-connected, by reformulating and localizing a closure concept due to Ryja c ek, which turns claw-free graphs into l

Sufficient condition for Hamiltonicity o

Sufficient condition for Hamiltonicity of N2-locally connected claw-free graphs

✍ Halina Bielak 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 89 KB

Hamiltonicity and Minimum Degree in 3-co

Hamiltonicity and Minimum Degree in 3-connected Claw-Free Graphs

✍ Odile Favaron; Pierre Fraisse 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 112 KB

Using Ryja c ek's closure, we prove that any 3-connected claw-free graph of order & and minimum degree $ &+38 10 is hamiltonian. This improves a theorem of Kuipers and Veldman who got the same result with the stronger hypotheses $ &+29 8 and & sufficiently large and nearly proves their conjecture sa

Hamilton connectivity of line graphs and

Hamilton connectivity of line graphs and claw-free graphs

✍ Zhiquan Hu; Feng Tian; Bing Wei 📂 Article 📅 2005 🏛 John Wiley and Sons 🌐 English ⚖ 117 KB

## Abstract Let __G__ be a graph and let __V__~0~ = {ν∈ __V__(__G__): __d__~__G__~(ν) = 6}. We show in this paper that: (i) if __G__ is a 6‐connected line graph and if |__V__~0~| ≤ 29 or __G__[__V__~0~] contains at most 5 vertex disjoint __K__~4~'s, then __G__ is Hamilton‐connected; (ii) every 8‐co