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

Fig. 24

From: Classes of tree-based networks

Fig. 24

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

Back to article page