Fig. 13From: Efficient solution for finding Hamilton cycles in undirected graphsDodecahedron graphBack to article page