Combinatorica Package >

PerfectQ

PerfectQ[g]
yields True if is a perfect graph, meaning that for every induced subgraph of the size of a largest clique equals the chromatic number.
Ask a question about this page  |  Suggest an improvement  |  Leave a message for the team
Format:   HTML  |  CDF