Combinatorica`
Combinatorica`
VertexColoring
As of Version 10, most of the functionality of the Combinatorica package is built into the Wolfram System. »
VertexColoring[g]
uses Brelaz's heuristic to find a good, but not necessarily minimal, vertex coloring of graph 
.
更多信息和选项
- 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.
Wolfram Research (2012)，VertexColoring，Wolfram 语言函数，https://reference.wolfram.com/language/Combinatorica/ref/VertexColoring.html.
文本
Wolfram Research (2012)，VertexColoring，Wolfram 语言函数，https://reference.wolfram.com/language/Combinatorica/ref/VertexColoring.html.
CMS
Wolfram 语言. 2012. "VertexColoring." Wolfram 语言与系统参考资料中心. Wolfram Research. https://reference.wolfram.com/language/Combinatorica/ref/VertexColoring.html.
APA
Wolfram 语言. (2012). VertexColoring. Wolfram 语言与系统参考资料中心. 追溯自 https://reference.wolfram.com/language/Combinatorica/ref/VertexColoring.html 年