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