![](/files/happy5.png)
Conjecture Every
-connected graph with a Hamilton cycle has a second Hamilton cycle.
![$ 4 $](/files/tex/1f1498726bb4b7754ca36de46c0ccdd09136d115.png)
Bibliography
*[F] H. Fleischner, Uniquely Hamiltonian graphs of minimum degree four,, J. Graph Theory, to appear.
* indicates original appearance(s) of problem.