Home » Subject » Graph Theory » Basic G.T. » Cycles

4-connected graphs are not uniquely hamiltonian

Importance: Medium ✭✭
Author(s): Fleischner, Herbert
Subject: Graph Theory
» Basic Graph Theory
» » Cycles
Keywords:
Recomm. for undergrads: no
Posted by: fhavet
on: March 11th, 2013
Conjecture   Every $ 4 $-connected graph with a Hamilton cycle has a second Hamilton cycle.

Related problems

r-regular graphs are not uniquely hamiltonian.

Bibliography

*[F] H. Fleischner, Uniquely Hamiltonian graphs of minimum degree four,, J. Graph Theory, to appear.


* indicates original appearance(s) of problem.
add new comment