Hamiltonian path

Summary

A Hamiltonian path in a graph is a path that visits every vertex exactly once. It is the open form of a Hamiltonian cycle. Deciding whether a graph has a Hamiltonian path is NP-complete, and no simple criterion like Euler's parity test for Eulerian trails is known. The node Hamiltonian path gives the precise definition.