Figure 8From: Extracting conflict-free information from multi-labeled treesSupportive illustration for the proof of Lemma 7. The leaves attached to pendant nodes u, v, and y are labeled by ℓ, and the subtrees indicated by T u and T y do not contain a leaf labeled with ℓ. Nodes u and y have degree two in T′, while v has degree three.Back to article page