Hamiltonicity in 3-connected claw-free graphs

Kuipers and Veldman conjectured that any 3-connected claw-free graph with order v and minimum degree δ ≥ (v+6)/10 is Hamiltonian for v sufficiently large. In this paper, we prove that if H is a 3-connected claw-free graph with sufficiently large order v, and if δ (H) ≥ (v + 5)/10, then either H is Hamiltonian, or δ(H) = (v+5)/10 and the Ryjacek's closure cl(H) of H is the line graph of a graph obtained from the Petersen graph P10 by adding (v - 15)/10 pendant edges at each vertex of P10.

[1]  Paul A. Catlin,et al.  A reduction method to find spanning Eulerian subgraphs , 1988, J. Graph Theory.

[2]  G. G. Stokes "J." , 1890, The New Yale Book of Quotations.

[3]  Ernst Kuipers,et al.  Recognizing claw-free Hamiltonian graphs with large minimum degree , 1998 .

[4]  Zdeněk Ryjáčk On a Closure Concept in Claw-Free Graphs , 1997 .

[5]  Zdenek Ryjácek On a Closure Concept in Claw-Free Graphs , 1997, J. Comb. Theory, Ser. B.

[6]  Hong-Jian Lai,et al.  Supereulerian Graphs and the Petersen Graph , 1996, J. Comb. Theory, Ser. B.

[7]  Elwood S. Buffa,et al.  Graph Theory with Applications , 1977 .

[8]  F. Harary,et al.  On Eulerian and Hamiltonian Graphs and Line Graphs , 1965, Canadian Mathematical Bulletin.

[9]  Zhi-Hong Chen Supereuleriaun graphs and the Petersen graph , 1991 .

[10]  David P. Sumner,et al.  Hamiltonian results in K1, 3-free graphs , 1984, J. Graph Theory.

[11]  J. A. Bondy,et al.  Graph Theory with Applications , 1978 .

[12]  Hong-Jian Lai Eulerian subgraphs containing given vertices and hamiltonian line graphs , 1998, Discret. Math..

[13]  Hong-Jian Lai,et al.  Eulerian subgraphs and Hamilton-connected line graphs , 2005, Discret. Appl. Math..

[14]  Odile Favaron,et al.  Hamiltonicity and Minimum Degree in 3-connected Claw-Free Graphs , 2001, J. Comb. Theory, Ser. B.

[15]  Zdenek Ryjácek,et al.  Clique covering and degree conditions for hamiltonicity in claw-free graphs , 2001, Discret. Math..

[16]  Hong-Jian Lai,et al.  Eulerian subgraphs in 3-edge-connected graphs and Hamiltonian line graphs , 2003, J. Graph Theory.

[17]  Zdenek Ryjácek,et al.  A note on degree conditions for hamiltonicity in 2-connected claw-free graphs , 2002, Discret. Math..