Combinatorica Package >

VertexColoring

VertexColoring[g]
uses Brelaz's heuristic to find a good, but not necessarily minimal, vertex coloring of graph .
  • 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.
Ask a question about this page  |  Suggest an improvement  |  Leave a message for the team
Format:   HTML  |  CDF