Fig. 9From: Efficient solution for finding Hamilton cycles in undirected graphsDifferent possible Hamiltonian circuits of the complete graphBack to article page