Linked from

The 6 pages that link to Hamiltonian cycle, each with the reason it gives.

• Hamiltonian pathCompared with: It adds a closing edge between the path’s endpoints.

• Hamiltonian path problemRelated: It adds a closing edge to the kind of spanning path tested here.

• Travelling salesman problemRelated: Each tour is a Hamiltonian cycle in the graph of cities and travel costs.

• Courcelle's theoremBroader topic: Its existence is definable in monadic second-order logic and becomes tractable at bounded treewidth.

• Fleischner's theoremBroader topic: Fleischner's theorem guarantees such a cycle in the graph square.

• Lovász conjectureCompared with: A cycle is stronger than the path required by the conjecture.