𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Closure, clique covering and degree conditions for Hamilton-connectedness in claw-free graphs

✍ Scribed by Roman Kužel; Zdeněk Ryjáček; Jakub Teska; Petr Vrána

Book ID
113567626
Publisher
Elsevier Science
Year
2012
Tongue
English
Weight
729 KB
Volume
312
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On stability of Hamilton-connectedness u
On stability of Hamilton-connectedness under the 2-closure in claw-free graphs
✍ Zdeněk Ryjáček; Petr Vrána 📂 Article 📅 2010 🏛 John Wiley and Sons 🌐 English ⚖ 269 KB 👁 1 views

We show that, in a claw-free graph, Hamilton-connectedness is preserved under the operation of local completion performed at a vertex with 2-connected neighborhood. This result proves a conjecture by Bollobás et al.

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

Closure, 2-factors, and cycle coverings
Closure, 2-factors, and cycle coverings in claw-free graphs
✍ Ryj�?ek, Zden?k; Saito, Akira; Schelp, R. H. 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 239 KB 👁 3 views

In this article, we study cycle coverings and 2-factors of a claw-free graph and those of its closure, which has been defined by the first author (On a closure concept in claw-free graphs, J Combin Theory Ser B 70 (1997), 217-224). For a claw-free graph G and its closure cl(G), we prove: ( 1 (2) G