Answers are grounded in this paper and cite their sources.
A graph is uniquely hamiltonian if it contains exactly one hamiltonian cycle. In this note we prove that there are no r ‐regular uniquely hamiltonian graphs when r > 22. This improves upon earlier results of Thomassen.
No takes yet. Share an insight, caveat, or question.
Haxell et al. (2006) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: