An implicit degree condition for Hamiltonian cycles in k-connected claw-free graphs
Bin Chen · jOURNAL OF southwest University for Nationalities · 2007
In this paper,we give a new concept of strong essential independent set,and prove the following theorem: Let k≥ 2 and let G be a k-connected claw-free graph on n vertices such that max{d2(x)│x∈S}≥n│2 for every strong essential independent set S on k vertices.Then G is Hamiltonian.