Gr\"unbaum Colorings of Toroidal Triangulations
Combinatorics
2008-05-06 v1
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.
Cite
@article{arxiv.0805.0394,
title = {Gr\"unbaum Colorings of Toroidal Triangulations},
author = {Michael O. Albertson and Hannah Alpert and sarah-marie belcastro and Ruth Haas},
journal= {arXiv preprint arXiv:0805.0394},
year = {2008}
}
Comments
17 pages, 8 figures, submitted for review for publication