𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On Hamiltonicity of 3-Connected Claw-Free Graphs

✍ Scribed by Runli Tian, Liming Xiong, Zhaohong Niu

Book ID
120664333
Publisher
Springer Japan
Year
2013
Tongue
English
Weight
255 KB
Volume
30
Category
Article
ISSN
0911-0119

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

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

On 1-Hamilton-connected claw-free graphs
On 1-Hamilton-connected claw-free graphs
✍ Kaiser, TomΓ‘Ε‘; RyjÑček, ZdenΔ›k; VrΓ‘na, Petr πŸ“‚ Article πŸ“… 2014 πŸ› Elsevier Science 🌐 English βš– 594 KB
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