A five-color theorem for graphs on surfaces
Joan P. Hutchinson · Proceedings of the American Mathematical Society · 1984
We prove that if a graph embeds on a surface with all edges suitably short, then the vertices of the graph can be five-colored. The motivation is that a graph embedded with short edges is locally a planar graph and hence should not require many more than four colors.