Journal of Graph Theory
We prove that if G is a triangulation of the torus and χ(G) 6 ≠ 5, then there is a 3-coloring of the edges of G so that the edges bounding every face are assigned three different colors.
embedding, edge coloring, Grünbaum coloring, Grünbaum conjecture, triangulation
Albertson, Michael O.; Alpert, Hannah; Belcastro, Sarah-Marie; and Haas, Ruth, "Grünbaum Colorings of Toroidal Triangulations" (2009). Faculty Publications. Paper 2.