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