Assertion: given graph | /r/CapableOf | admit a k-coloring
Facets:
value: for a given
type: OTHER
value: except for the cases
type: OTHER
Source sentences:
text: It is NP-complete to decide if a given graph admits a k-coloring for a given k except for the cases k ∈ {0,1,2} .