|
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
|
|
|
>
|
|
|
>
|
|
|
>
|
|
|
>
|
|
|
| (1) |
|
>
|
|
|
| (2) |
|
>
|
|
|
![[[1, 3, 8, 10], [2, 4, 6], [5, 7, 9]]](/support/helpjp/helpview.aspx?si=6031/file01780/math98.png)
| (3) |
|
|
Download Help Document
Was this information helpful?
