Figure 1From: Characterizing compatibility and agreement of unrooted trees via cuts in graphsCompatible trees. (i) First input tree. (ii) A second input tree, compatible with the first. (iii) Display graph of the input trees. (iv) Edge label intersection graph of the input trees; for each vertex, uv represents edge {u,v} of the display graph.Back to article page