Assertion: perfect graph | /r/HasProperty | graph
Facets:
Source sentences:
text: Perfect graphs are the graphs in which, for every induced subgraph, the chromatic number equals the size of the maximum clique.