Hamiltonian path
noun
°A path through an undirected graph which visits each vertex exactly once.