Hamiltonian problem

Hamiltonian problem

(computability)(Or "Hamilton's problem") A problem in graph theory posed by William Hamilton: given a graph, is therea path through the graph which visits each vertex preciselyonce (a "Hamiltonian path")? Is there a Hamiltonian pathwhich ends up where it started (a "Hamiltonian cycle" or"Hamiltonian tour")?

Hamilton's problem is NP-complete. It has numerousapplications, sometimes completely unexpected, in computing.

http://ing.unlp.edu.ar/cetad/mos/Hamilton.html.