Assertion: graph's number | /r/HasProperty | graph coloring problem
Facets:
Source sentences:
text: For the perfect graphs, a number of NP-complete optimization problems (graph coloring problem, maximum clique problem, and maximum independent set problem) are polynomially solvable.