Acyclic k-strong coloring of maps on surfaces

Mathematical Notes

Volumn 67, Issue 1, 2000, Pages 29-35

  Borodin, O V ^a   Kostochka, A V ^b   Raspaud, A ^c   Sopena, E ^c  

^a SOBOLEV INSTITUTE OF MATHEMATICS   (Russian Federation)

^b NOVOSIBIRSK STATE UNIVERSITY   (Russian Federation)

^c UNIVERSITÉ DE BORDEAUX   (France)

Author keywords

Acyclic coloring; Acyclic graphs; Cliques; Embedded graphs; Map coloring

Indexed keywords

EID: 7544236914     PISSN: 00014346     EISSN: None     Source Type: Journal    
DOI: 10.1007/BF02675788     Document Type: Article

References (18)

1. K. Appel and W. Haken, "The solution of the four-color-map problem," Scientific American, 237, No. 4, 108-121 (1977).
2. P. J. Heawood, "Map-color theorem," Quart. J. Math., 24, 332-338 (1890).
3. O. V. Borodin, "Solution for Ringel's problems on vertex-face colorings of flat graphs and on colorings of 1-flat graphs," Discrete Analysis. Novosibirsk, 41, 12-26 (1984).
4. G. Ringel, "Ein Sechsfarbenproblem auf der Kugel," Abh. Math. Sem. Univ. Hamburg, 29, 107-117 (1965).
5. H. Schumacher, "Ein 7-Farbensatz 1-einbettbarer Graphen auf der projektiven Ebene," Abh. Math. Sem. Univ. Hamburg, 54, 5-14 (1984).
6. G. Ringel, "A nine color theorem for the torus and the Klein bottle," in: The Theory and Applications of Graphs (Kalamazoo, Mich., 1980), Wiley, New York (1981), pp. 507-515.
7. O. Ore and M. D. Plummer, "Cyclic coloration of plane graphs," in: Recent Progress in Combinatorics, Academic Press, New York (1969), pp. 287-293.
8. O. V. Borodin, D. Sanders, and Y. Zhao, "On cyclic colorings and their generalizations," Discrete Math. (to appear).
9. O. V. Borodin, "On acyclic coloring of planar graphs," Diskrete Math., 25, 198-223 (1979).
10. M. Albertson and D. Berman, "An acyclic analogue to Heawood's theorem," Glasgow Math. J., 19, 169-174 (1977).
11. N. Alon, B. Mohar, and D. P. Sanders, "On acyclic colorings of graphs on surfaces," Israel J. Math., 94, 273-283 (1996).
12. N. Alon and T. H. Marshall, "Homomorphisms of edge-colored graphs and Coxeter groups," J. Algebraic Combinatorics, 2, 277-289 (1998).
13. B. Grünbaum, "Acyclic colorings of planar graphs," Israel J. Math., 14, No. 3, 390-408 (1973).
14. T. R. Jensen and B. Toft, Graph Coloring Problems, Wiley, New York (1995).
15. J. Nešetřil and A. Raspaud, Colored Homomorphisms of Colored Mixed Graphs, KAM Series NO. 98-376. Dept. of Applied Math, Charles University, Prague (1998).
16. A. Raspaud and E. Sopena, "Good and semi-strong colorings of oriented planar graphs," Inform. Processing Letters, 51, 171-174 (1994).
17. I. Algor and N. Alon, "The star arboricity of graphs," Discrete Math., 75, 11-22 (1989).
18. O. V. Borodin, A. V. Kostochka, A. Raspaud, and E. Sopena, "On acyclic 20-colorability of 1-flat graphs," Discrete Analysis and Operations Research. Ser. I, Novosibirsk, 6, No. 4, 20-36 (1999).