biconnected graph
Sign in to saveAlso known as 2-connected graph, 2-vertex-connected graph, nonseparable graph, non-separable graph
graph on at least 3 vertices that remains connected when any one vertex is removed
Wikidata facts
Show 3 more facts
- does not have characteristic
- cut vertex
- does not have part
- cut vertex
- studied by
- graph theory
Sources (2)
via Wikidata · CC0