A graph that has a Hamiltonian Cycle

• if it instead has a hamiltonian path it is called a weakly hamiltonian path

Hamiltonian Cycle

A cycle which visits every vertex in a graph exactly once

Hamiltonian Path

A path that visits every vertex in a graph exactly once