Color-induced subgraphs of Grünbaum colorings of triangulations of the sphere.
Eric Gottlieb, Kennan Shelton · 2004
A Grünbaum coloring of a triangulation is an assignment of colors to edges so that the edges about each face are assigned unique colors. In this paper we examine the color induced subgraphs given by a Grünbaum coloring of a triangulation and show that the existence of connected color induced subgraphs is equivalent to the Three Color Theorem.