# Maximum of Seven Colors Needed for Proper Vertex Coloring on Torus

## Theorem

Let $G$ be a graph embedded on the surface of a torus.

$G$ can be assigned a proper vertex $k$-coloring such that $k \le 7$.

## Historical Note

This result was known before the Four Color Theorem, its counterpart for planar graphs.