Macaulay2 » Documentation
Packages » Graphs :: isPerfect
next | previous | forward | backward | up | index | toc

isPerfect -- checks whether a graph is perfect



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.

i1 : G = graph {{1,2},{1,3},{1,4},{2,5},{5,3},{3,2}};
i2 : isPerfect G

o2 = true

See also

Ways to use isPerfect :

For the programmer

The object isPerfect is a method function.