Figure 11From: Efficient enumeration of monocyclic chemical graphs with given path frequenciesIllustration of candidate pairs. A graph G will be created by adding each edge shown by a black dotted line. However, no vertex pair for any of edges a,b and c is a candidate pair. We do not have to add edges a,b, and c to T1,T2, and T3, respectively because neither G−a, G−b, nor G−c can be the parent of G.Back to article page