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 g.

Details

Wolfram Research (2012), VertexColoring, Wolfram Language function, https://reference.wolfram.com/language/Combinatorica/ref/VertexColoring.html.

Text

Wolfram Research (2012), VertexColoring, Wolfram Language function, https://reference.wolfram.com/language/Combinatorica/ref/VertexColoring.html.

BibTeX

@misc{reference.wolfram_2021_vertexcoloring, author="Wolfram Research", title="{VertexColoring}", year="2012", howpublished="\url{https://reference.wolfram.com/language/Combinatorica/ref/VertexColoring.html}", note=[Accessed: 26-September-2021 ]}

BibLaTeX

@online{reference.wolfram_2021_vertexcoloring, organization={Wolfram Research}, title={VertexColoring}, year={2012}, url={https://reference.wolfram.com/language/Combinatorica/ref/VertexColoring.html}, note=[Accessed: 26-September-2021 ]}

CMS

Wolfram Language. 2012. "VertexColoring." Wolfram Language & System Documentation Center. Wolfram Research. https://reference.wolfram.com/language/Combinatorica/ref/VertexColoring.html.

APA

Wolfram Language. (2012). VertexColoring. Wolfram Language & System Documentation Center. Retrieved from https://reference.wolfram.com/language/Combinatorica/ref/VertexColoring.html