Hamiltonian path

Definition from Wiktionary, the free dictionary
Jump to: navigation, search


Camera icon.svg This entry needs a photograph or drawing for illustration. Please try to find a suitable image on Wikimedia Commons or upload one there yourself!


Hamiltonian path (plural Hamiltonian paths)

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


See also[edit]