Hamiltonian path

A Hamiltonian path in a graph is a path that visits each vertex exactly once.