✦ LIBER ✦

Mengerian properties, hamiltonicity, and claw-free graphs

✍ Scribed by E. Flandrin; H. Li

Publisher: John Wiley and Sons
Year: 1994
Tongue: English
Weight: 603 KB
Volume: 24
Category: Article
ISSN: 0028-3045
DOI: 10.1002/net.3230240305

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Toughness and hamiltonicity in almost cl

Toughness and hamiltonicity in almost claw-free graphs

✍ Broersma, H.J.; Ryj�?ek, Z.; Schiermeyer, I. 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 491 KB 👁 3 views

Some known results on claw-free (Kl,3-free) graphs are generalized to the larger class of almost claw-free graphs which were introduced by RyjaEek. In particular, w e show that a 2-connected almost claw-free graph is I-tough, and that a 2-connected almost claw-free graph on n vertices is hamiltonian

Hamiltonicity in claw-free graphs throug

Hamiltonicity in claw-free graphs through induced bulls

✍ Zdeněk Ryjáček 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 323 KB

Hamilton cycles in claw-free graphs

✍ Cun-Quan Zhang 📂 Article 📅 1988 🏛 John Wiley and Sons 🌐 English ⚖ 299 KB 👁 2 views

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

Maximal K3's and Hamiltonicity of 4-conn

Maximal K3's and Hamiltonicity of 4-connected claw-free graphs

✍ Jun Fujisawa; Katsuhiro Ota 📂 Article 📅 2011 🏛 John Wiley and Sons 🌐 English ⚖ 255 KB 👁 1 views

## Abstract Let __cl__(__G__) denote Ryjáček's closure of a claw‐free graph __G__. In this article, we prove the following result. Let __G__ be a 4‐connected claw‐free graph. Assume that __G__[__N__~__G__~(__T__)] is cyclically 3‐connected if __T__ is a maximal __K__~3~ in __G__ which is also maxim