DOCUMENTATION CENTER SEARCH
Combinatorica Package
>
Combinatorica
Package Symbol
Combinatorica
Tutorials »
|
ChromaticNumber
ChromaticPolynomial
EdgeColoring
See Also »
|
Graph Properties
More About »
VertexColoring
VertexColoring[
g
]
uses Brelaz's heuristic to find a good, but not necessarily minimal, vertex coloring of graph
.
MORE INFORMATION
To use
VertexColoring
, you first need to load the
Combinatorica
Package
using
Needs
["Combinatorica`"]
.
An option
Algorithm
that can take on the values
Brelaz
or
Optimum
is allowed.
The setting
Algorithm
->
Brelaz
is the default, while the setting
Algorithm
->
Optimum
forces the algorithm to do an exhaustive search to find an optimum vertex coloring.
SEE ALSO
ChromaticNumber
ChromaticPolynomial
EdgeColoring
TUTORIALS
Combinatorica
MORE ABOUT
Graph Properties
© 2008 Wolfram Research, Inc.
