Assertion: line graph | /r/HasProperty | well-covered
Facets:
value: in polynomial time
type: OTHER
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.
text: It is possible to test whether a line graph, or more generally a claw-free graph, is well-covered in polynomial time.