HamiltonianN2-locally connected claw-free graphs
Hong‐Jian Lai, Yehong Shao, Mingquan Zhan · Journal of Graph Theory · 2004
A graph G is N2-locally connected if for every vertex ν in G, the edges not incident with ν but having at least one end adjacent to ν in G induce a connected graph. In 1990, Ryjáček conjectured that every 3-connected N2-locally connected claw-free graph is Hamiltonian. This conjecture is proved in this note. © 2004 Wiley Periodicals, Inc. J Graph Theory 48: 142–146, 2005