Hamiltonian cycles in regular 3-connected claw-free graphs Original Research Article

A known result by the author in 1991 is that every 3-connected claw-free graph on at most 6δ-11 vertices is Hamiltonian. In this paper it is proved that every 3-connected k-regular claw-free graph on at most 7k — 19 vertices is Hamiltonian.