Assertion: graph | /r/HasProperty | k-colorable
Facets:
Source sentences:
text: A graph that can be assigned a (proper) k-coloring is k-colorable, and it is k-chromatic if its chromatic number is exactly k.