A minimal vertex cover is an vertex cover of a graph that is not a proper subset of any other vertex cover. A minimal vertex cover corresponds to the complement of maximal independent vertex set, so the counts of minimal vertex covers and maximal independent vertex sets in a graph are identical. Every minimum vertex cover is a minimal vertex cover, but the converse does not necessarily hold.

independent vertex set | maximal independent vertex set | minimal set | minimum vertex cover | vertex cover