Finding recurrent RNA structural networks with fast maximal common subgraphs of edge-colored graphs
Fig 3
Impact of proper edge-coloring on graph-matching.
This figure displays a piece of two graphs (G on the left and H on the right) in which the nodes 0 and a are already matched together. The next step is to match their neighbours. In the generic case, all permutations have to be tested. On the contrary, in the example displayed, the colors of the edges limit the options to consider to a single one.