Skip to main content
Fig. 18 | Visual Computing for Industry, Biomedicine, and Art

Fig. 18

From: Classes of tree-based networks

Fig. 18

Case 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 ≥ 7

Back to article page