KnowraHamiltonian pathLinked fromLinked fromThe 6 pages that link to Hamiltonian path, each with the reason it gives.All 6Broader topic 2Related 2Compared with 2Path (graph theory)Broader topic: It is a spanning path with a demanding vertex-coverage condition.Path graphRelated: The defining vertex order of a path graph is itself a Hamiltonian path.Hamiltonian cycleCompared with: It drops the closing-edge requirement while retaining the all-vertices condition.Fleischner's theoremCompared with: The theorem guarantees a closed spanning cycle in the square, not merely a spanning path.Generalized Petersen graphRelated: Whether these graphs contain spanning paths or cycles varies with their parameters.Lovász conjectureBroader topic: This is the spanning structure the conjecture predicts.