Definition:Hamiltonian Path

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

Also known as
A Hamiltonian path is also known as a Hamiltonian chain by sources that refer to a path as a chain.

Also see

 * Definition:Hamilton Cycle