Hamiltonian claw-free graphs
Hong‐Jian Lai, Yehong Shao, Ju Zhou, Hehui Wu · 2005
A graph is claw-free if it does not have an induced subgraph isomorphic to a K1,3. In this paper, we proved the every 3-connected, essentially 11-connected claw-free graph is hamiltonian. We also present two related results concerning hamiltonian claw-free graphs. 1