Assertion: graph | /r/HasProperty | recognized in polynomial time
Facets:
Source sentences:
text: Known characterizations of the well-covered cubic graphs, well-covered claw-free graphs, and well-covered graphs of high girth allow these graphs to be recognized in polynomial time, but testing whether other kinds of graph are well-covered is a coNP-complete problem.