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

Fig. 26

From: Classes of tree-based networks

Fig. 26

Case 10 in the proof of Lemma 5 for n ≥ 7. The dashed edge {z1, z2} may either be present or absent and the dotted line depicts some path between z1′ and z2 which must exist since G is biconnected

Back to article page