Fig. 18From: Classes of tree-based networksCase 2 in the proof of Lemma 5 for n ≥ 7. The dotted line depicts some path between u and v (possibly consisting of a single edge) that must exist since G is biconnected and n ≥ 7Back to article page