Definition:Hamilton Cycle
From ProofWiki
Definition
A Hamilton cycle (or hamiltonian cycle, with or without a capital H) in a graph is a cycle that contains every vertex of the graph (but not necessarily every edge).
Compare Hamiltonian path.
Source of Name
This entry was named for William Rowan Hamilton.
Sources
- Gary Chartrand: Introductory Graph Theory (1977): $\S 3.2$
