Biconnected graph | Article about biconnected graph by The Free Dictionary
Also found in: Wikipedia
biconnected graph[¦bī·kə′nek·təd ′graf]
A connected graph in which two points must be removed to disconnect the graph.
References in periodicals archive
2] or is a homeomorphic copy of a 3-regular biconnected graph
Definition 1 Let C be a class of labeled connected graphs and let B [subset] C be the class of biconnected graphs in C.
where B(x, y) is the exponential generating function enumerating the biconnected graphs in C.