
Conjecture Every 4-connected line graph is hamiltonian.
- \item It is known that if


Bibliography
[R] Zdenek Ryjacek: On a closure concept in claw-free graphs. J. Combin. Theory Ser. B 70 (1997), no. 2, 217--224, MathSciNet
*[T] Carsten Thomassen, Reflections on graph theory, J. Graph Theory 10 (1986) 309-324, MathSciNet
* indicates original appearance(s) of problem.