Assertion: clique's vertex | /r/CapableOf | have at most three neighbors
Facets:
Source sentences:
text: In graphs where every vertex has at most three neighbors, the clique cover remains NP-hard, and there is a constant ρ > 1 such that it is NP-hard to approximate with approximation ratio ρ or better.