An implicit degree condition for hamiltonian cycles in k-connected graphs
Xiaohong Li · jOURNAL OF southwest University for Nationalities · 2007
This paper gives a new concept of strong essential independent set, and proves the following theorem: Let k ≥ 2 and let G be a k-connected graph on n vertices such that max{d 1 (x)|x∈ S}≥n/2for every strong essential independent set S on k vertices. Then G is hamiltonian.