Separable Graph

A graph G is said to be separable if it is either disconnected or can be disconnected by removing one vertex, called articulation. A graph that is not separable is said to be biconnected (or nonseparable).

See also

Articulation Vertex, Biconnected Graph, Quasiseparable Graph

This entry contributed by Margherita Barile

Explore with Wolfram|Alpha

Cite this as:

Barile, Margherita. "Separable Graph." From MathWorld--A Wolfram Web Resource, created by Eric W. Weisstein.

Subject classifications