also: ししょくていり
four-color theorem; four-color map theorem
A mathematical theorem stating that any map in a plane can be colored with at most four colors so that no two adjacent regions share the same color. Used in graph theory and topology.
The four-color theorem is one of the first major theorems to be proved using a computer.
The coloring of maps is related to the four-color theorem.