Editing Hamiltonian path (section)

==See also==
{{div col|colwidth=30em}}
* [[Barnette's conjecture]], an open problem on Hamiltonicity of cubic [[bipartite graph|bipartite]] [[polyhedral graph]]s
* [[Eulerian path]], a path through all edges in a graph
* [[Fleischner's theorem]], on Hamiltonian [[power of graph|squares of graphs]]
* [[Gray code]]
* [[Grinberg's theorem]] giving a necessary condition for [[planar graph]]s to have a Hamiltonian cycle
* [[Hamiltonian path problem]], the computational problem of finding Hamiltonian paths
* [[Hypohamiltonian graph]], a non-Hamiltonian graph in which every vertex-deleted subgraph is Hamiltonian
* [[Knight's tour]], a Hamiltonian cycle in the [[knight's graph]]
* [[LCF notation]] for Hamiltonian [[cubic graph]]s.
* [[Lovász conjecture]] that [[vertex-transitive graph]]s are Hamiltonian
* [[Pancyclic graph]], graphs with cycles of all lengths including a Hamiltonian cycle
*[[Panconnectivity]], a strengthening of both pancyclicity and Hamiltonian-connectedness
* [[Seven Bridges of Königsberg]]
* [[Shortness exponent]], a numerical measure of how far from Hamiltonian the graphs in a family can be
* [[Snake-in-the-box]], the longest [[induced path]] in a hypercube
* [[Steinhaus–Johnson–Trotter algorithm]] for finding a Hamiltonian path in a [[permutohedron]]
* [[Subhamiltonian graph]], a subgraph of a [[planar graph|planar]] Hamiltonian graph
* [[Tait's conjecture]] (now known false) that 3-regular [[polyhedral graph]]s are Hamiltonian
* [[Travelling salesman problem]]
* [[Harris graph|Harris graphs]], a family of graphs that are tough, [[Eulerian path|Eulerian]], and non-Hamiltonian{{div col end}}