An edge coloring of a graph minimum
edge coloring .
The Wolfram Language function FindEdgeColoring g ]
is documented to find a minimum edge coloring.
The edge chromatic number gives the minimum
number of colors with which a graph's edges can be colored.
See also Chromatic Number ,
Edge Chromatic Number ,
Graph Coloring ,
k -Coloring,
Labeled Graph ,
Minimum
Edge Coloring ,
Minimum Vertex Coloring ,
Vertex Coloring
Explore with Wolfram|Alpha
References Fiorini, S. and Wilson, R. Edge-Colourings of Graphs. Nemhauser, G. L. and Park, S.
"A Polyhedral Approach to Edge Coloring." Operations Res. Lett. 10 ,
315-322, 1991. Saaty, T. L. and Kainen, P. C. The
Four-Color Problem: Assaults and Conquest. Skiena,
S. "Edge Colorings." §5.5.4 in Implementing
Discrete Mathematics: Combinatorics and Graph Theory with Mathematica. Referenced on Wolfram|Alpha Edge Coloring
Cite this as:
Weisstein, Eric W. "Edge Coloring." From
MathWorld https://mathworld.wolfram.com/EdgeColoring.html
Subject classifications
is a coloring of the edges of 
such that adjacent edges (or the edges bounding different
regions) receive different colors. An edge coloring containing the smallest possible
number of colors for a given graph is known as a minimum
edge coloring.
