Definition:Hamiltonian Path

A Hamiltonian path in a graph is a path that contains every vertex of the graph (but not necessarily every edge).

Compare Hamilton cycle.