minimum vertex cover
vertex cover of a graph having the smallest possible number of vertices
Press Enter · cited answer in seconds
0 sources
minimum vertex cover
Summary
Key Facts
- minimum vertex cover's subclass of is recorded as minimal vertex cover[1].
- minimum vertex cover's opposite of is recorded as maximum independent set[2].
- minimum vertex cover's facet of is recorded as vertex cover problem[3].
- minimum vertex cover's has characteristic is recorded as vertex cover number[4].
- minimum vertex cover's different from is recorded as minimal vertex cover[5].
- minimum vertex cover's MathWorld ID is recorded as MinimumVertexCover[6].
- minimum vertex cover's set cardinality is recorded as vertex cover number[7].
- minimum vertex cover's maintained by WikiProject is recorded as WikiProject Mathematics[8].