Fig. 23From: Classes of tree-based networksCase 7 in the proof of Lemma 5. The dotted line depicts some path between u and x which must exist since n ≥ 7 and G is biconnectedBack to article page