info prev up next book cdrom email home


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. Brelaz's Heuristic Algorithm can be used to find a good, but not necessarily minimal, edge-coloring.

See also Brelaz's Heuristic Algorithm, Chromatic Number, k-Coloring


Saaty, T. L. and Kainen, P. C. The Four-Color Problem: Assaults and Conquest. New York: Dover, p. 13, 1986.

© 1996-9 Eric W. Weisstein