Hamiltonian N2-locally connected claw-free graphs

A graph G is N2-locally connected if for every vertex v in G, the edges not incident with v but having at least one end adjacent to v in G induce a connected graph. In 1990, Ryjác̆ek conjectured that every 3-connected N2-locally connected claw-free graph is hamiltonian. This conjecture is proved in this note.

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

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

[3]  Zdenek Ryjácek.  Hamiltonian circuits in N2-locally connected K1, 3-free graphs , 1990, J. Graph Theory.

[4]  David P. Sumner,et al.  Every connected, locally connected nontrivial graph with no induced claw is hamiltonian , 1979, J. Graph Theory.

[5]  Hong-Jian Lai.  Graph whose edges are in small cycles , 1991, Discret. Math..

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

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