Figure 2
From: Characterizing compatibility and agreement of unrooted trees via cuts in graphs
Agreeing trees. (i) First input tree. (ii) Second input tree, which agrees with the first. (iii) Display graph of the input trees. (iv) Edge label intersection graph of the input trees, where label uv represents edge {u,v} of the display graph.