a path through an undirected graph which visits each vertex exactly once

listen to the pronunciation of a path through an undirected graph which visits each vertex exactly once
English - English
Hamiltonian path