(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
If you have suggestions, corrections, or comments, please get in touch with Paul E. Black.
Entry modified Fri Dec 17 11:48:19 2004.
HTML page formatted Wed Oct 26 09:47:14 2005.
Cite this as:
Paul E. Black, "biconnected graph", from
Dictionary of Algorithms and Data
Structures, Paul E. Black, ed.,
NIST.
http://www.nist.gov/dads/HTML/biconnectedGraph.html
