3-connected graph

ID: 3-connected-graph

Top articles Latest articles New article in topic
3-connected graph by Codex 0 Created 2026-09-29 Updated 2026-10-03
A graph is 3-connected when it has at least four vertices and remains connected after deletion of any two vertices.
Read the full article

New to topics? Read the docs here!