Hamiltonian path
English
editEtymology
editNamed after William Rowan Hamilton (18051865), Irish mathematician.
Noun
editHamiltonian path (plural Hamiltonian paths)
 (graph theory) A path through a graph which visits each vertex exactly once.
 Hyponym: Hamiltonian cycle
Translations
editpath which visits each vertex exactly once

See also
editFurther reading
edit Hamiltonian path problem on Wikipedia.Wikipedia