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