EdgeColoring[g]
uses Brelaz's heuristic to find a good, but not necessarily minimal, edge coloring of graph g.


EdgeColoring
EdgeColoring[g]
uses Brelaz's heuristic to find a good, but not necessarily minimal, edge coloring of graph g.
Details and Options
- To use EdgeColoring, you first need to load the Combinatorica Package using Needs["Combinatorica`"].
See Also
Tech Notes
Related Guides
-
▪
- Combinatorica Package ▪
- Graph Properties ▪
- Graphs & Networks ▪
- Graph Visualization ▪
- Computation on Graphs ▪
- Graph Construction & Representation ▪
- Graphs and Matrices ▪
- Graph Properties & Measurements ▪
- Graph Operations and Modifications ▪
- Statistical Analysis ▪
- Social Network Analysis ▪
- Graph Properties ▪
- Mathematical Data Formats ▪
- Discrete Mathematics
Text
Wolfram Research (2012), EdgeColoring, Wolfram Language function, https://reference.wolfram.com/language/Combinatorica/ref/EdgeColoring.html.
CMS
Wolfram Language. 2012. "EdgeColoring." Wolfram Language & System Documentation Center. Wolfram Research. https://reference.wolfram.com/language/Combinatorica/ref/EdgeColoring.html.
APA
Wolfram Language. (2012). EdgeColoring. Wolfram Language & System Documentation Center. Retrieved from https://reference.wolfram.com/language/Combinatorica/ref/EdgeColoring.html
BibTeX
@misc{reference.wolfram_2025_edgecoloring, author="Wolfram Research", title="{EdgeColoring}", year="2012", howpublished="\url{https://reference.wolfram.com/language/Combinatorica/ref/EdgeColoring.html}", note=[Accessed: 08-August-2025]}
BibLaTeX
@online{reference.wolfram_2025_edgecoloring, organization={Wolfram Research}, title={EdgeColoring}, year={2012}, url={https://reference.wolfram.com/language/Combinatorica/ref/EdgeColoring.html}, note=[Accessed: 08-August-2025]}