Assertion: covered graph | /r/HasProperty | covered graphs
Facets:
value: well
type: DEGREE
Source sentences:
text: In a well-covered graph with n vertices, the size of a maximum independent set is at most n/2, so very well covered graphs are the well covered graphs in which the maximum independent set size is as large as possible.