Definition: A connected graph such that deleting any two vertices (and incident edges) results in a graph that is still connected.
See also biconnected graph, k-connected graph, cut vertex.
Note: After Tomas Rokicki <email@example.com>, 24 December 2002.
Informally, there are at least three independent paths from any vertex to any other vertex. After Paul M. Sant, 6 Sep 2000.
If you have suggestions, corrections, or comments, please get in touch with Paul Black.
Entry modified 17 December 2004.
HTML page formatted Wed Mar 13 12:42:46 2019.
Cite this as:
Paul E. Black, "triconnected graph", in Dictionary of Algorithms and Data Structures [online], Paul E. Black, ed. 17 December 2004. (accessed TODAY) Available from: https://www.nist.gov/dads/HTML/triconnectedGraph.html