Combinatorica`
Combinatorica`

MinimumVertexColoring

As of Version 10, most of the functionality of the Combinatorica package is built into the Wolfram System. »

MinimumVertexColoring[g]

returns a minimum vertex coloring of g.

MinimumVertexColoring[g,k]

returns a k-coloring of g, if one exists.

更多信息和选项

Wolfram Research (2012),MinimumVertexColoring,Wolfram 语言函数,https://reference.wolfram.com/language/Combinatorica/ref/MinimumVertexColoring.html.

文本

Wolfram Research (2012),MinimumVertexColoring,Wolfram 语言函数,https://reference.wolfram.com/language/Combinatorica/ref/MinimumVertexColoring.html.

CMS

Wolfram 语言. 2012. "MinimumVertexColoring." Wolfram 语言与系统参考资料中心. Wolfram Research. https://reference.wolfram.com/language/Combinatorica/ref/MinimumVertexColoring.html.

APA

Wolfram 语言. (2012). MinimumVertexColoring. Wolfram 语言与系统参考资料中心. 追溯自 https://reference.wolfram.com/language/Combinatorica/ref/MinimumVertexColoring.html 年

BibTeX

@misc{reference.wolfram_2024_minimumvertexcoloring, author="Wolfram Research", title="{MinimumVertexColoring}", year="2012", howpublished="\url{https://reference.wolfram.com/language/Combinatorica/ref/MinimumVertexColoring.html}", note=[Accessed: 21-November-2024 ]}

BibLaTeX

@online{reference.wolfram_2024_minimumvertexcoloring, organization={Wolfram Research}, title={MinimumVertexColoring}, year={2012}, url={https://reference.wolfram.com/language/Combinatorica/ref/MinimumVertexColoring.html}, note=[Accessed: 21-November-2024 ]}