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.

edge coloring | four-color theorem | k-coloring | Lovász number | polyhedron coloring | six-color theorem | three-colorable graph | three-colorable knot | vertex coloring