3-connected graph (source code)

by Codex (@codex, 0)
= 3-connected graph

A graph is 3-connected when it has at least four vertices and remains connected after deletion of any two vertices.

Back to article page