✦ LIBER ✦

Closure and Hamiltonian-connectivity of claw-free graphs

✍ Scribed by Béla Bollobás; Oliver Riordan; Zdeněk Ryjáček; Akira Saito; R.H. Schelp

Book ID: 108316280
Publisher: Elsevier Science
Year: 1999
Tongue: English
Weight: 756 KB
Volume: 195
Category: Article
ISSN: 0012-365X
DOI: 10.1016/s0012-365x(98)00165-4

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Hamiltonian Connected Claw-Free Graphs

✍ MingChu Li 📂 Article 📅 2004 🏛 Springer Japan 🌐 English ⚖ 395 KB

Closure and stable Hamiltonian propertie

Closure and stable Hamiltonian properties in claw-free graphs

✍ Brandt, Stephan; Favaron, Odile; Ryj�?ek, Zden?k 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 171 KB 👁 3 views

In the class of k-connected claw-free graphs, we study the stability of some Hamiltonian properties under a closure operation introduced by the third author. We prove that (i) the properties of pancyclicity, vertex pancyclicity and cycle extendability are not stable for any k (i.e., for any of these

All 4-connected Line Graphs of Claw Free

All 4-connected Line Graphs of Claw Free Graphs Are Hamiltonian Connected

✍ Matthias Kriesell 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 109 KB

Thomassen conjectured that every 4-connected line graph is hamiltonian. Here we shall see that 4-connected line graphs of claw free graphs are hamiltonian connected.

Hamiltonian cycles in 3-connected claw-f

Hamiltonian cycles in 3-connected claw-free graphs

✍ MingChu Li 📂 Article 📅 1993 🏛 John Wiley and Sons 🌐 English ⚖ 437 KB 👁 2 views

Hamiltonian cycles in 2-connected claw-f

Hamiltonian cycles in 2-connected claw-free-graphs

✍ Hao Li 📂 Article 📅 1995 🏛 John Wiley and Sons 🌐 English ⚖ 418 KB 👁 2 views

## Abstract M. Matthews and D. Sumner have proved that of __G__ is a 2‐connected claw‐free graph of order __n__ such that δ ≧ (__n__ − 2)/3, then __G__ is hamiltonian. We prove that the bound for the minimum degree δ can be reduced to __n__/4 under the additional condition that __G__ is not in __F_

Hamiltonian N2-locally connected claw-fr

Hamiltonian N2-locally connected claw-free graphs

✍ Hong-Jian Lai; Yehong Shao; Mingquan Zhan 📂 Article 📅 2004 🏛 John Wiley and Sons 🌐 English ⚖ 63 KB 👁 1 views

A graph G is N 2 -locally connected if for every vertex v in G, the edges not incident with v but having at least one end adjacent to v in G induce a connected graph. In 1990, Ryja ´c ˇek conjectured that every 3-connected N 2 -locally connected claw-free graph is Hamiltonian. This conjecture is pro