✦ LIBER ✦

Hamilton cycles in claw-free graphs

✍ Scribed by Cun-Quan Zhang

Publisher: John Wiley and Sons
Year: 1988
Tongue: English
Weight: 299 KB
Volume: 12
Category: Article
ISSN: 0364-9024
DOI: 10.1002/jgt.3190120211

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Hourglasses and Hamilton cycles in 4-con

Hourglasses and Hamilton cycles in 4-connected claw-free graphs

✍ Tomáš Kaiser; MingChu Li; Zdeněk Ryjáček; Liming Xiong 📂 Article 📅 2005 🏛 John Wiley and Sons 🌐 English ⚖ 97 KB 👁 1 views

## Abstract We show that if __G__ is a 4‐connected claw‐free graph in which every induced hourglass subgraph __S__ contains two non‐adjacent vertices with a common neighbor outside __S__, then __G__ is hamiltonian. This extends the fact that 4‐connected claw‐free, hourglass‐free graphs are hamilton

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_

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

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

Cycles through particular subgraphs of c

Cycles through particular subgraphs of claw-free graphs

✍ H. J. Broersma; M. Lu 📂 Article 📅 1995 🏛 John Wiley and Sons 🌐 English ⚖ 301 KB

## Abstract Let __G__ be a 2‐connected claw‐free graph on __n__ vertices, and let __H__ be a subgraph of __G__. We prove that __G__ has a cycle containing all vertices of __H__ whenever α~3~(__H__) ≧ κ(__G__), where α~3~(__H__) denotes the maximum number of vertices of __H__ that are pairwise at di