Hamiltonian path

English

A two-dimensional Hamiltonian path (also a Hamiltonian cycle)

Etymology

Named after William Rowan Hamilton (1805-1865), Irish mathematician.

Noun

Hamiltonian path (plural Hamiltonian paths)

1. (graph theory) A path through a graph which visits each vertex exactly once.

   Hyponym: Hamiltonian cycle

Translations

path which visits each vertex exactly once

• Dutch: Hamiltonpad n
• Finnish: Hamiltonin polku
• French: chemin hamiltonien m
• German: Hamilton-Pfad m
• Hungarian: Hamilton-út (hu)
• Italian: cammino hamiltoniano m
• Polish: ścieżka hamiltonowska f

See also

• travelling salesman problem

Further reading

• Hamiltonian path problem on Wikipedia.Wikipedia