Hamiltonian path

== English == === Etymology === Named after William Rowan Hamilton (1805-1865), Irish mathematician. === Noun === Hamiltonian path (plural Hamiltonian paths) (graph theory) A path through a graph which visits each vertex exactly once. Hyponym: Hamiltonian cycle ==== Translations ==== === See also === travelling salesman problem === Further reading === Hamiltonian path problem on Wikipedia.Wikipedia