A minimum edge coloring of a graph 
is an edge coloring that
uses the fewest possible colors. The task of finding one is the edge
coloring problem.
The Wolfram Language function FindEdgeColoring[g]
is documented to find a minimum edge coloring.
The number of colors in a minimum edge coloring is the edge
chromatic number.
See also
Chromatic Number,
Edge Chromatic Number,
Edge Coloring,
Edge
Coloring Problem,
Graph Coloring,
k-Coloring,
Labeled Graph,
Minimum
Vertex Coloring,
Vertex Coloring
Explore with Wolfram|Alpha
References
Fiorini, S. and Wilson, R. Edge-Colourings of Graphs. Pittman, 1977.Saaty, T. L. and Kainen, P. C.
The
Four-Color Problem: Assaults and Conquest. New York: Dover, p. 13, 1986.Referenced
on Wolfram|Alpha
Minimum Edge Coloring
Cite this as:
Weisstein, Eric W. "Minimum Edge Coloring."
From MathWorld--A Wolfram Resource. https://mathworld.wolfram.com/MinimumEdgeColoring.html
Subject classifications
