Figure 2From: Characterizing compatibility and agreement of unrooted trees via cuts in graphsAgreeing 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.Back to article page