An edge coloring of a graph G is a coloring of the edges of G 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. A (not necessarily minimum) edge coloring of a graph can be computed using EdgeColoring[g] in the Wolfram Language package Combinatoricaˋ . The edge chromatic number gives the minimum number of colors with which graph's edges can be colored.

chromatic number | edge chromatic number | graph coloring | k-coloring | labeled graph | minimum edge coloring | minimum vertex coloring | vertex coloring