next | previous | forward | backward | up | top | index | toc | Macaulay2 website

Graphs :: isPerfect

isPerfect -- checks whether a graph is perfect

Synopsis

Usage:

p = isPerfect G
Inputs:
- G, an instance of the type Graph,
Outputs:
- p, a Boolean value, whether the graph is perfect

Description

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

chromaticNumber -- Computes the chromatic number of a graph
cliqueNumber -- Returns the clique number of a graph
hasOddHole -- checks whether a graph has a odd hole

Ways to use `isPerfect` :

"isPerfect(Graph)"

For the programmer

The object isPerfect is a method function.