Assertion: graph's cover | /r/HasAspect | same number of vertices
Facets:
value: as each other
type: OTHER
Source sentences:
text: In the original paper defining well-covered graphs, Plummer (1970) writes that this is "obviously equivalent" to the property that every two minimal covers have the same number of vertices as each other.