A coloring of plane regions, link segments, etc., is an assignment of a distinct labeling (which could be a number, letter, color, etc.) to each component. Coloring problems generally involve topological considerations (i.e., they depend on the abstract study of the arrangement of objects), and theorems about colorings, such as the famous four-color theorem, can be extremely difficult to prove.
Coloring
See also
Edge Coloring, Four-Color Theorem, k-Coloring, Lovász Number, Polyhedron Coloring, Six-Color Theorem, Three-Colorable Graph, Three-Colorable Knot, Vertex ColoringExplore with Wolfram|Alpha
References
Eppstein, D. "Coloring." http://www.ics.uci.edu/~eppstein/junkyard/color.html.Saaty, T. L. and Kainen, P. C. The Four-Color Problem: Assaults and Conquest. New York: Dover, 1986.Referenced on Wolfram|Alpha
ColoringCite this as:
Weisstein, Eric W. "Coloring." From MathWorld--A Wolfram Web Resource. https://mathworld.wolfram.com/Coloring.html