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