biconnected graph


Also found in: Wikipedia.

biconnected graph

[¦bī·kə′nek·təd ′graf]
(mathematics)
A connected graph in which two points must be removed to disconnect the graph.
References in periodicals archive ?
Their strategy is to build a biconnected graph where an articulation point does not exist.
Also the LEGO graph from [17] is a biconnected graph. Fig.
To extend Algorithm 4.1 to any graph G of treewidth at most 2 and maximum degree 3, we infer from Proposition 2.1 that each biconnected component of G either is isomorphic to [K.sub.2] or is a homeomorphic copy of a 3-regular biconnected graph. Moreover, each of the latter kind of biconnected components meets only the [K.sub.2]-type components.
Definition 1 Let C be a class of labeled connected graphs and let B [subset] C be the class of biconnected graphs in C.