3-Regular Non 3-Edge-Colorable Graphs with Polyhedral Embeddings in Orientable Surfaces

  • Martin Kochol
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 5417)


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.


Planar Graph Dual Form Orientable Surface Multiple Edge Parallel Edge 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


  1. 1.
    Albertson, M.O., Alpert, H., Belcastro, S.-M., Haas, R.: Grünbaum colorings of toroidal triangulations (manuscript) (April 2008)Google Scholar
  2. 2.
    Appel, K., Haken, W.: Every Planar Map Is Four Colorable. Contemp. Math., vol. 98. Amer. Math. Soc., Providence, RI (1989)Google Scholar
  3. 3.
    Archdeacon, D.: Problems in topological graph theory: Three-edge-coloring planar triangulations,
  4. 4.
    Belcastro, S.-M., Kaminski, J.: Families of dot-product snarks on orientable surfaces of low genus. Graphs Combin. 23, 229–240 (2007)CrossRefzbMATHMathSciNetGoogle Scholar
  5. 5.
    Diestel, R.: Graph Theory, 3rd edn. Springer, Heidelberg (2005)zbMATHGoogle Scholar
  6. 6.
    Gross, J.L., Tuker, T.W.: Topological Graph Theory. Wiley, New York (1987)zbMATHGoogle Scholar
  7. 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
  8. 8.
    Holyer, I.: The NP-completeness of edge-coloring. SIAM J. Comput. 10, 718–720 (1981)CrossRefzbMATHMathSciNetGoogle Scholar
  9. 9.
    Kochol, M.: Snarks without small cycles. J. Combin. Theory Ser. B 67, 34–47 (1996)CrossRefzbMATHMathSciNetGoogle Scholar
  10. 10.
    Kochol, M.: Superposition and constructions of graphs without nowhere-zero k-flows. European J. Combin. 23, 281–306 (2002)CrossRefzbMATHMathSciNetGoogle Scholar
  11. 11.
    Tait, P.G.: Remarks on the colouring of maps. Proc. Roy. Soc. Edinburgh 10, 729 (1880)zbMATHGoogle Scholar
  12. 12.
    Vodopivec, A.: On embedding of snarks in the torus. Discrete Math. 308, 1847–1849 (2008)CrossRefzbMATHMathSciNetGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2009

Authors and Affiliations

  • Martin Kochol
    • 1
  1. 1.MÚ SAV, Štefánikova 49, 814 73 Bratislava 1, Slovakia and FPV ŽUSlovakia

Personalised recommendations