Assertion: graph's number | /r/CapableOf | use semidefinite programming
Facets:
Source sentences:
text: More generally, the chromatic number and a corresponding coloring of perfect graphs can be computed in polynomial time using semidefinite programming.