Fig. 11From: Efficient solution for finding Hamilton cycles in undirected graphs n-factor graph with n = 3Back to article page