Abstract
It is known that for any closed surface F2, every even embedding on F2 with sufficiently large representativity is 4-colorable. In this paper, we shall characterize 3-colorable even embeddings on F2 with sufficiently large representativity.
Similar content being viewed by others
References
Archdeacon, D., Hutchinson, J.P., Nakamoto, A., Negami, S., Ota, K.: Chromatic Numbers of Quadrangulations on Closed Surfaces. J. Graph Theory 37, 100–114 (2001)
Hutchinson, J.P.: On coloring maps made from Eulerian graphs. Proceeding of 5th British Combinatorial Conference, 1975'', pp. 343–354
Hutchinson, J.P.: Three-coloring graphs embedded on surfaces with all faces even-sided. J. Combin. Theory, Ser. B 65 139–155 (1995)
Mohar, B., Seymour, P.D.: Coloring locally bipartite graphs on surfaces. J. Combin. Theory, Ser. B 84, 301–310 (2002)
Negami, S., Nakamoto, A.: Diagonal transformations of graphs on closed surfaces. Sci. Rep. Yokohama Nat. Univ., Sec. I 40, 71–97 (1993)
Nakamoto, A., Negami, S., Ota, K.: Chromatic Numbers and Cycle Parities of Quanragulations on Nonorientable Closed Surfaces. Discrete Math. 285, 211–218 (2004)
Robertson, N., Seymour, P.D.: Graph Minors. VII, Disjoint paths on a surface. J. Combin. Theory, Ser. B 45, 212–254 (1988)
Youngs, D.A.: 4-chromatic projective graphs. J. Graph Theory 21, 219–227 (1996)
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Nakamoto, A., Sasanuma, N. 3-Colorable Even Embeddings on Closed Surfaces. Graphs and Combinatorics 23, 87–95 (2007). https://doi.org/10.1007/s00373-006-0687-7
Received:
Accepted:
Issue Date:
DOI: https://doi.org/10.1007/s00373-006-0687-7