PerfectQ

As of Version 10, most of the functionality of the Combinatorica package is built into the Wolfram System. >>

PerfectQ[g]

yields True if g is a perfect graph, meaning that for every induced subgraph of g, the size of a largest clique equals the chromatic number.

Details

See Also

ChromaticNumber  MaximumClique

Tutorials