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).

articulation vertex | biconnected graph | quasiseparable graph