|
GraphTheory[CircularChromaticIndex]
GraphTheory[CircularEdgeChromaticNumber]
|
|
Calling Sequence
|
|
CircularChromaticIndex(G, col)
CircularEdgeChromaticNumber(G, col)
|
|
|
Parameters
|
|
|
G
|
-
|
undirected unweighted graph
|
|
col
|
-
|
(optional) name used to return the list of colors of an optimal proper coloring
|
|
|
|
|
|
Description
|
|
|
•
|
The CircularChromaticIndex and CircularEdgeChromaticNumber commands return the circular chromatic index (circular edge 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 edge coloring. The algorithm uses a backtracking technique.
|
|
|
|
Examples
|
|
|
>
|
|
|
>
|
|
|
>
|
|
|
| (1) |
|
>
|
|
|
| (2) |
|
>
|
|
|
![[{1, 2} = 0, {1, 5} = 3, {1, 6} = 6, {2, 3} = 3, {2, 9} = 8, {3, 4} = 6, {3, 7} = 9, {4, 5} = 10, {4, 10} = 2, {5, 8} = 7, {6, 7} = 1, {6, 10} = 9, {7, 8} = 4, {8, 9} = 0, {9, 10} = 5]](/support/helpjp/helpview.aspx?si=6032/file01781/math95.png)
| (3) |
|
|
Download Help Document
Was this information helpful?
