Hamiltonicity in 3-connected claw-free graphs

Kuipers and Veldman conjectured that any 3-connected claw-free graph with order and minimum degree +6 10 is Hamiltonian for sufficiently large. In this paper, we prove that if H is a 3-connected claw-free graph with sufficiently large order , and if (H) +5 10 , then either H is hamiltonian, or (H) = +5 10 and the Ryj

• Type: Journal
• Year: 2006
• Where: JCT
• Authors: Hong-Jian Lai, Yehong Shao, Mingquan Zhan
• Keywords: 3-connected Claw-free Graph, JCT 2006, Minimum Degree, Sufficiently Large