Definition:Hamiltonian Path
Jump to navigation
Jump to search
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).
Also known as
A Hamiltonian path is also known as a Hamiltonian chain by sources that refer to a path as a chain.
Also see
Source of Name
This entry was named for William Rowan Hamilton.
Sources
- 1977: Gary Chartrand: Introductory Graph Theory ... (previous) ... (next): $\S 3.2$: The Salesman's Problem: An Introduction to Hamiltonian Graphs: Problem $22$
- 1989: Ephraim J. Borowski and Jonathan M. Borwein: Dictionary of Mathematics ... (previous) ... (next): chain: 4.
- 1989: Ephraim J. Borowski and Jonathan M. Borwein: Dictionary of Mathematics ... (previous) ... (next): Hamiltonian chain or path