Four Color Theorem

Theorem
Any planar graph $G$ can be assigned a proper vertex $k$-coloring such that $k \le 4$.

Also known as
In British English, this theorem is spelled four colour theorem.

Historical Note
[[Category:4]]