Circumference in three-connected claw-free graphs
Wen Liang-chen · Journal of Shenyang Institute of Aeronautcal Engineering · 2005
Hamilton problem is one of the most importance problems in Graph Theory, we have got many achievements, but there is no the result of what is the sufficient and necessary condition that a graph is a Hamiltonian graph, so we begin to study the longest cycle in graph. In this paper, we introduce the definition of spoke number, by way of contradiction, we get the lower bound of circumference in 3-connected claw-free graphs by the methods of constructing the longest cycle, it can be shown as .