Fig. 7From: Efficient solution for finding Hamilton cycles in undirected graphsConnectors reflection of the Petersen graph from Example 5. A When connector C1: (a, f, i, d, c, h, j, e, a) is reflected and B connector C2: (a, f, i, g, b, c, d, e, a) is reflectedBack to article page