(definition)

**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 <rokicki@instantis.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.*

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 Mon Nov 18 10:44:10 2013.

Cite this as:

Paul E. Black, "triconnected graph", in
*Dictionary of Algorithms and Data Structures* [online], Vreda Pieterse and Paul E. Black, eds. 17 December 2004. (accessed TODAY)
Available from: http://www.nist.gov/dads/HTML/triconnectedGraph.html