Chromatic numbers of quadrangulations on closed surfaces

It has been shown that every quadrangulation on any nonspherical orientable closed surface with a suf®ciently large representativity has chromatic number at most 3. In this paper, we show that a quadrangulation G on a nonorientable closed surface Nk has chromatic number at least 4 if G has a cycle of odd length which cuts open Nk into an orientable surface. Moreover, we characterize the quadrangulations on the torus and the Klein bottle with chromatic number exactly 3. By our characterization, we prove that every quadrangulation on the torus with representativity at least 9 has chromatic number at most 3, and that a quadrangulation on the Klein bottle with representativity at least 7 has chromatic number at most 3 if a cycle cutting open the Klein bottle into an annulus has even length. As an application of our theory, we prove that every nonorientable closed surface Nk admits an eulerian triangulation with chromatic number at least 5 which has arbitrarily large representativity. ß 2001 John Wiley & Sons, Inc. J Graph Theory 37: 100±114, 2001

[1]  Seiya Negami,et al.  Diagonal Transformations of Graphs on Closed Surfaces , 1993 .

[2]  D. A. Youngs.  4-chromatic projective graphs , 1996 .

[3]  Alexander Schrijver,et al.  Grid Minors of Graphs on the Torus , 1994, J. Comb. Theory, Ser. B.

[4]  Atsuhiro Nakamoto,et al.  Irreducible Quadrangulations of the Torus , 1996, J. Comb. Theory, Ser. B.

[5]  G. Dirac.  Map-Colour Theorems , 1952, Canadian Journal of Mathematics.

[6]  Bojan Mohar,et al.  The chromatic numbers of graph bundles over cycles , 1995, Discret. Math..

[7]  Joan P. Hutchinson,et al.  Three-Coloring Graphs Embedded on Surfaces with All Faces Even-Sided , 1995, J. Comb. Theory, Ser. B.

[8]  Steve Fisk,et al.  Combinatorial structure on triangulations. I. The structure of four colorings , 1973 .

[9]  Atsuhiro Nakamoto.  IRREDUCIBLE QUADRANGULATIONS OF THE KLEIN BOTTLE , 1995 .

[10]  Carsten Thomassen,et al.  Coloring graphs with fixed genus and girth , 1997 .

[11]  K. Appel,et al.  Every Planar Map Is Four Colorable , 2019, Mathematical Solitaires & Games.

[12]  Bojan Mohar,et al.  Separating and Nonseparating Disjoint Homotopic Cycles in Graph Embeddings , 1996, J. Comb. Theory, Ser. B.

[13]  Atsuhiro Nakamoto,et al.  Note on irreducible triangulations of surfaces , 1995, J. Graph Theory.

[14]  J. Thomas.  The four color theorem , 1977 .

[15]  G. A. Dirac,et al.  Short Proof of a Map-Colour Theorem , 1957, Canadian Journal of Mathematics.

[16]  G. Ringel.  Map Color Theorem , 1974 .