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.

minimal set | minimum vertex cut | vertex cut