Hamiltonian path
Jump to navigation
Jump to search
English
[edit]Etymology
[edit]Named after William Rowan Hamilton (1805-1865), Irish mathematician.
Noun
[edit]Hamiltonian path (plural Hamiltonian paths)
- (graph theory) A path through a graph which visits each vertex exactly once.
- Hyponym: Hamiltonian cycle
Translations
[edit]path which visits each vertex exactly once
|
See also
[edit]Further reading
[edit]- Hamiltonian path problem on Wikipedia.Wikipedia