p = isPerfect G
A perfect graph is a graph where the chromatic number of every induced subgraph of G is equal to the clique number in that subgraph.
|
|
The object isPerfect is a method function.
The source of this document is in Graphs.m2:4514:0.