Hamiltonian path
Definition from Wiktionary, the free dictionary
English[edit]
Noun[edit]
Hamiltonian path (plural Hamiltonian paths)
 (graph theory) A path through an undirected graph which visits each vertex exactly once.
Translations[edit]
path which visits each vertex exactly once

