Four Color Theorem

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