Minimal Vertex Cut

A minimal vertex cut is a vertex cut of a graph that does not contain any other vertex cut as a proper subset.

Every minimum vertex cut is a minimal vertex cut, but the converse does not necessarily hold.

See also

Minimal Set, Minimum Vertex Cut, Vertex Cut

Explore with Wolfram|Alpha

More things to try:

Cite this as:

Weisstein, Eric W. "Minimal Vertex Cut." From MathWorld--A Wolfram Resource. https://mathworld.wolfram.com/MinimalVertexCut.html

Subject classifications