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