Assertion: graph's matching | /r/HasProperty | maximum
Facets:
Source sentences:
text: A graph is said to be equimatchable if every maximal matching is maximum; that is, it is equimatchable if its line graph is well-covered.