GraphTheory[ChromaticNumber] - Maple Help

Online Help

All Products    Maple    MapleSim


Home : Support : Online Help : Mathematics : Discrete Mathematics : Graph Theory : GraphTheory Package : GraphTheory/ChromaticNumber

GraphTheory[ChromaticNumber]

Calling Sequence

ChromaticNumber(G, col)

ChromaticNumber(G, `bound`)

Parameters

G

-

undirected unweighted graph

col

-

(optional) name

Description

• 

ChromaticNumber computes the chromatic number of a graph G. If a name col is specified, then this name is assigned the list of color classes of an optimal proper coloring of vertices. The algorithm uses a backtracking technique.

• 

If the option `bound` is provided, then an estimate of the chromatic number of the graph is returned. Another optional name, if provided, is not assigned.

Examples

withGraphTheory:

withSpecialGraphs:

P:=PetersenGraph:

ChromaticNumberP,'bound'

3..3

(1)

ChromaticNumberP,'col'

3

(2)

col

1,3,8,10,2,4,6,5,7,9

(3)

See Also

CircularChromaticNumber, EdgeChromaticNumber, GreedyColor, IsVertexColorable, Mycielski


Download Help Document

Was this information helpful?



Please add your Comment (Optional)
E-mail Address (Optional)
What is ? This question helps us to combat spam