✦ LIBER ✦

Hamilton cycles in claw-heavy graphs

✍ Scribed by Bing Chen; Shenggui Zhang; Shengning Qiao

Book ID: 108114026
Publisher: Elsevier Science
Year: 2009
Tongue: English
Weight: 509 KB
Volume: 309
Category: Article
ISSN: 0012-365X
DOI: 10.1016/j.disc.2008.04.013

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Hamilton cycles in claw-free graphs

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

Claw Conditions for Heavy Cycles in Weig

Claw Conditions for Heavy Cycles in Weighted Graphs

✍ Jun Fujisawa 📂 Article 📅 2005 🏛 Springer Japan 🌐 English ⚖ 370 KB

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 👁 2 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

Hamilton cycles in 3-connected claw-free

Hamilton cycles in 3-connected claw-free and net-free graphs

✍ Xiong, Wei; Lai, Hong-Jian; Ma, Xiaoling; Wang, Keke; Zhang, Meng 📂 Article 📅 2013 🏛 Elsevier Science 🌐 English ⚖ 347 KB

Hamilton cycles in regular graphs

✍ Bill Jackson 📂 Article 📅 1978 🏛 John Wiley and Sons 🌐 English ⚖ 135 KB

## UNIVERSIW OF WATERLOO ' The research reported here has been sponsored by the Canadian Commonwealth Association.

Hamiltonicity in 2-connected graphs with

Hamiltonicity in 2-connected graphs with claws

✍ Hao Li; Mei Lu; Zhiren Sun 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 562 KB

Matthews and Sumner have proved in [12] that if G is a 2-connected claw-free graph of order n such that 6>~(n-2)/3, then G is hamiltonian. Li has shown that the bound for the minimum degree 6 can be reduced to n/4 under the additional condition that G is not in /7, where /7 is a class of graphs defi