A Hamiltonian Circuit in a graph is a circuit that contains each vertex in exactly once, except for the starting and ending vertex that appears twice. Removing any edge from a Hamiltonian circuit produces a Hamiltonian path.