3-Regular Non 3-Edge-Colorable Graphs with Polyhedral Embeddings in Orientable Surfaces
The Four Color Theorem is equivalent with its dual form stating that each 2-edge-connected 3-regular planar graph is 3-edge-colorable. In 1968, Grünbaum conjectured that similar property holds true for any orientable surface, namely that each 3-regular graph with a polyhedral embedding in an orientable surface has a 3-edge-coloring. Note that an embedding of a graph in a surface is called polyhedral if its geometric dual has no multiple edges and loops. We present a negative solution of this conjecture, showing that for each orientable surface of genus at least 5, there exists a 3-regular non 3-edge-colorable graph with a polyhedral embedding in the surface.
KeywordsPlanar Graph Dual Form Orientable Surface Multiple Edge Parallel Edge
- 1.Albertson, M.O., Alpert, H., Belcastro, S.-M., Haas, R.: Grünbaum colorings of toroidal triangulations (manuscript) (April 2008)Google Scholar
- 2.Appel, K., Haken, W.: Every Planar Map Is Four Colorable. Contemp. Math., vol. 98. Amer. Math. Soc., Providence, RI (1989)Google Scholar
- 3.Archdeacon, D.: Problems in topological graph theory: Three-edge-coloring planar triangulations, http://www.emba.uvm.edu/~archdeac/problems/grunbaum.htm
- 7.Grünbaum, B.: Conjecture 6. In: Tutte, W.T. (ed.) Recent Progress in Combinatorics, Proceedings of the Third Waterloo Conference on Combinatorics, May 1968, p. 343. Academic Press, New York (1969)Google Scholar