Assertion: complete bipartite graph | /r/HasProperty | covered
Facets:
value: well
type: DEGREE
Source sentences:
text: A complete bipartite graph is well covered if the two sides of its bipartition have equal numbers of vertices, for these are its only two maximal independent sets.