Gr\"unbaum Colorings of Toroidal Triangulations
Abstract
We prove that if G is a triangulation of the torus and (G) ≠ 5, then there is a 3-coloring of the edges of G so that the edges bounding every face are assigned three different colors.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.