minimal vertex cover
vertex cover of a graph that is not a proper superset of any other vertex cover
Press Enter · cited answer in seconds
0 sources
minimal vertex cover
Summary
Key Facts
- minimal vertex cover's subclass of is recorded as vertex cover[1].
- minimal vertex cover's opposite of is recorded as maximal independent set[2].
- minimal vertex cover's has characteristic is recorded as minimal with respect to set inclusion[3].
- minimal vertex cover's different from is recorded as minimum vertex cover[4].
- minimal vertex cover's MathWorld ID is recorded as MinimalVertexCover[5].
- minimal vertex cover's maintained by WikiProject is recorded as WikiProject Mathematics[6].