KnowraHamiltonian path problemLinked fromLinked fromThe 3 pages that link to Hamiltonian path problem, each with the reason it gives.All 3Broader topic 1Related 2Path (graph theory)Related: It asks whether a path can cover every vertex, a central hard path question.BacktrackingRelated: Building a path one vertex at a time allows dead ends to be abandoned immediately.