NIST

biconnected graph

(definition)

Definition: A connected graph that is not broken into disconnected pieces by deleting any single vertex (and incident edges).

See also cut vertex, biconnected component, triconnected graph, k-connected graph.

Note: Informally, there are at least two independent paths from any vertex to any other vertex.

After Algorithms and Theory of Computation Handbook, page 6-6, Copyright © 1999 by CRC Press LLC.

Author: PEB


Go to the Dictionary of Algorithms and Data Structures home page.

If you have suggestions, corrections, or comments, please get in touch with Paul Black.

Entry modified 17 December 2004.
HTML page formatted Fri Feb 23 10:06:07 2018.

Cite this as:
Paul E. Black, "biconnected graph", in Dictionary of Algorithms and Data Structures [online], Vreda Pieterse and Paul E. Black, eds. 17 December 2004. (accessed TODAY) Available from: https://www.nist.gov/dads/HTML/biconnectedGraph.html