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