Hamiltonian path

English

Two-dimensional Hammiltonian path

Etymology

Named after William Rowam 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.

Translations

path which visits each vertex exactly once

• Dutch: Hamiltonpad n
• Finnish: Hamiltonin polku
• German: Hamilton-Pfad m
• (deprecated template usage) {{trans-mid}}
• Hungarian: Hamilton-út (hu)
• Polish: ścieżka hamiltonowska f

See also

• Hamiltonian cycle
• travelling salesman problem