Fig. 12From: Efficient solution for finding Hamilton cycles in undirected graphsThe graph after implementing a connector pathBack to article page