Hamiltonian Paths and Cycles

In a Hamiltonian graph, there exists a path that visits every vertex in the graph exactly once. Such a path is called a Hamiltonian path or cycle.