Sheehan's conjecture on uniquely Hamiltonian regular graphs
A finite graph is -regular if every vertex has degree , and a Hamilton cycle is a cycle containing every vertex of the graph exactly once.
Sheehan's conjecture. There is no finite -regular graph with a unique Hamilton cycle for any .
This conjecture concerns whether uniqueness of a Hamilton cycle can occur in finite regular graphs of degree greater than two. It is still open, although partial results have been proved.
References
- Karl Heuer, “Hamiltonicity in locally finite graphs: two extensions and a counterexample”, arXiv:1701.06029 (2018).
Progress summary
Never refreshed
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
No solutions have been posted yet.