Editing Hamiltonian path (section)

==Examples==
{{Hamiltonian platonic graphs.svg}}
* A [[complete graph]] with more than two vertices is Hamiltonian
* Every [[cycle graph]] is Hamiltonian
* Every [[tournament (graph theory)|tournament]] has an odd number of Hamiltonian paths ([[László Rédei|Rédei]] 1934)
* Every [[platonic solid]], considered as a graph, is Hamiltonian<ref>[http://www.scientificamerican.com/magazine/sa/1957/05-01/ Gardner, M. "Mathematical Games: About the Remarkable Similarity between the Icosian Game and the Towers of Hanoi." Sci. Amer. 196, 150–156, May 1957]
</ref>
* The [[Cayley graph]] of a finite [[Coxeter group]] is Hamiltonian  (For more information on Hamiltonian paths in Cayley graphs, see the [[Lovász conjecture]].)
* [[Cayley graph]]s on [[nilpotent group]]s with cyclic [[commutator subgroup]] are Hamiltonian.<ref>{{Cite journal| last1=Ghaderpour|first1=E.|last2=Morris|first2=D. W.|date=2014|title=Cayley graphs on nilpotent groups with cyclic commutator subgroup are Hamiltonian|journal=Ars Mathematica Contemporanea|language=en|volume=7|issue=1|pages=55–72| doi=10.26493/1855-3974.280.8d3| arxiv=1111.6216|s2cid=57575227 }}</ref>
* The [[flip graph]] of a convex polygon or equivalently, the [[Tree rotation|rotation graph]] of [[binary tree]]s, is Hamiltonian.<ref>{{citation
 | last = Lucas | first = Joan M.
 | doi = 10.1016/0196-6774(87)90048-4
 | issue = 4
 | journal = Journal of Algorithms
 | pages = 503–535
 | title = The rotation graph of binary trees is Hamiltonian
 | volume = 8
 | year = 1987}}</ref><ref>{{citation
 | last1 = Hurtado | first1 = Ferran | author-link = Ferran Hurtado
 | last2 = Noy | first2= Marc
 | doi = 10.1016/S0925-7721(99)00016-4 | doi-access=free
 | issue = 3
 | journal = [[Computational Geometry (journal)|Computational Geometry]]
 | pages = 179–188
 | title = Graph of triangulations of a convex polygon and tree of triangulations
 | volume = 13
 | year = 1999}}</ref>