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$.