Gr\"unbaum Colorings of Toroidal Triangulations
classification
🧮 math.CO
keywords
edgesassignedboundingcoloringcoloringscolorsdifferentevery
read the original abstract
We prove that if G is a triangulation of the torus and \chi(G) \neq 5, then there is a 3-coloring of the edges of G so that the edges bounding every face are assigned three different colors.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.