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 /build/reproducible-path/macaulay2-1.25.05+ds/M2/Macaulay2/packages/Graphs.m2:4514:0.