A `` Hamiltonian path '' or `` traceable path '' is a path that visits each vertex exactly once . A graph that contains a Hamiltonian path is called a traceable graph .
A Hamiltonian path is a path in a graph which contains each vertex of the graph exactly once .