(Or "Hamilton' S problem") A problem in {graph theory} poSed by {William Hamilton}: given a {graph}, iS there a path through the graph which viSitS each vertex preciSely once (a "Hamiltonian path")? IS there a Hamiltonian path which endS up where it Started (a "Hamiltonian cycle" or "Hamiltonian tour")? Hamilton' S problem iSNP-complete. It haS numerouS applicationS, SometimeS completely unexpected, in computing. Start . (1997-07-18)