|
GraphTheory[CircularChromaticNumber]
|
|
Calling Sequence
|
|
CircularChromaticNumber(G, col)
|
|
|
Parameters
|
|
|
G
|
-
|
undirected unweighted graph
|
|
col
|
-
|
(optional) name
|
|
|
|
|
|
Description
|
|
|
•
|
The CircularChromaticNumber command returns the circular chromatic number of a graph G. If a name col is specified, then this name is assigned the list of colors of an optimal proper coloring of vertices. The algorithm uses a backtracking technique.
|
|
|
|
Examples
|
|
|
>
|
|
|
>
|
|
|
>
|
|
|
>
|
|
|
| (1) |
|
>
|
|
|
![[0, 2, 4, 1, 3, 2, 0, 2, 0, 2, 4, 1, 4, 1, 3, 1, 3, 0, 3, 0]](/support/helpjp/helpview.aspx?si=6033/file01782/math82.png)
| (2) |
|
|
Download Help Document
Was this information helpful?
