A minimal vertex cut is an vertex cut of a graph that is not a proper subset of any other vertex cut.
Every minimum vertex cut is a minimal vertex cut, but the converse does not necessarily hold.
A minimal vertex cut is an vertex cut of a graph that is not a proper subset of any other vertex cut.
Every minimum vertex cut is a minimal vertex cut, but the converse does not necessarily hold.
Weisstein, Eric W. "Minimal Vertex Cut." From MathWorld--A Wolfram Web Resource. https://mathworld.wolfram.com/MinimalVertexCut.html