Assertion: graph's vertex | /r/HasProperty | set into k independent sets
Facets:
Source sentences:
text: Thus, a k-coloring is the same as a partition of the vertex set into k independent sets, and the terms k-partite and k-colorable have the same meaning.