Fig. 24From: Classes of tree-based networksCase 8 in the proof of Lemma 5 for n ≥ 7. The dashed edge {x, y} may be present or not and the dotted line depicts some path between x′ and y, which must exist since G is biconnected and n ≥ 7Back to article page