EdgeChromaticNumber[g]
gives the fewest number of colors necessary to color each edge of graph g, so that no two edges incident on the same vertex have the same color.


EdgeChromaticNumber
EdgeChromaticNumber[g]
gives the fewest number of colors necessary to color each edge of graph g, so that no two edges incident on the same vertex have the same color.
Details and Options
- To use EdgeChromaticNumber, you first need to load the Combinatorica Package using Needs["Combinatorica`"].
See Also
Tech Notes
Related Guides
-
▪
- 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), EdgeChromaticNumber, Wolfram Language function, https://reference.wolfram.com/language/Combinatorica/ref/EdgeChromaticNumber.html.
CMS
Wolfram Language. 2012. "EdgeChromaticNumber." Wolfram Language & System Documentation Center. Wolfram Research. https://reference.wolfram.com/language/Combinatorica/ref/EdgeChromaticNumber.html.
APA
Wolfram Language. (2012). EdgeChromaticNumber. Wolfram Language & System Documentation Center. Retrieved from https://reference.wolfram.com/language/Combinatorica/ref/EdgeChromaticNumber.html
BibTeX
@misc{reference.wolfram_2025_edgechromaticnumber, author="Wolfram Research", title="{EdgeChromaticNumber}", year="2012", howpublished="\url{https://reference.wolfram.com/language/Combinatorica/ref/EdgeChromaticNumber.html}", note=[Accessed: 09-August-2025]}
BibLaTeX
@online{reference.wolfram_2025_edgechromaticnumber, organization={Wolfram Research}, title={EdgeChromaticNumber}, year={2012}, url={https://reference.wolfram.com/language/Combinatorica/ref/EdgeChromaticNumber.html}, note=[Accessed: 09-August-2025]}