|
GraphTheory[GreedyColor]
|
|
Calling Sequence
|
|
GreedyColor(G, perm)
|
|
|
Parameters
|
|
|
G
|
-
|
undirected unweighted graph
|
|
perm
|
-
|
(optional) list of vertex labels
|
|
|
|
|
|
Description
|
|
|
•
|
The GreedyColor command colors the vertices of the graph in the order given by perm, one at a time, assigning to each vertex the smallest available color. If the permutation perm is not specified, the identity permutation is used.
|
|
|
|
Examples
|
|
|
>
|
|
|
>
|
|
|
| (1) |
|
>
|
|
|
![2, [0, 1, 0, 1, 0, 1]](/support/helpjp/helpview.aspx?si=6065/file01818/math72.png)
| (2) |
|
>
|
![G := PermuteVertices(C6, [1, 4, 2, 5, 3, 6])](/support/helpjp/helpview.aspx?si=6065/file01818/math76.png)
|
|
| (3) |
|
>
|
|
|
![3, [0, 0, 1, 1, 2, 2]](/support/helpjp/helpview.aspx?si=6065/file01818/math86.png)
| (4) |
|
|
Download Help Document
Was this information helpful?
