![](/files/happy5.png)
Hamiltonian cycles in line graphs
Conjecture Every 4-connected line graph is hamiltonian.
- \item It is known that if
![$ G $](/files/tex/b8e7ad0330f925492bf468b5c379baec88cf1b3d.png)
![$ L(G) $](/files/tex/76f6ee75811ed6d89f7e99f8aa7a505f462c30b2.png)
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.