We recall that a Hamiltonian path is defined as a path in an undirected graph which intersects each node once and only
once. A Hamiltonian cycle is then a Hamiltonian path which also returns to its initial node.