Coloring with no 2-colored P4's

Electronic Journal of Combinatorics

Volumn 11, Issue 1 R, 2004, Pages

  Albertson, Michael O ^a   Chappell, Glenn G ^b   Kierstead, H A ^c   Kündgen, André ^d   Ramamurthi, Radhika ^d  

^a SMITH COLLEGE   (United States)

^b UNIVERSITY OF ALASKA FAIRBANKS   (United States)

^c ARIZONA STATE UNIVERSITY   (United States)

^d CALIFORNIA STATE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84862383319     PISSN: 10778926     EISSN: None     Source Type: Journal    
DOI: 10.37236/1779     Document Type: Article

References (15)

1. M. O. Albertson, D. M. Berman, Every planar graph has an acyclic 7-coloring. Israel J. Math., 28 (1977), 169-174.
2. M. O. Albertson, D. M. Berman, An acyclic analogue to Heawood's theorem. Glasgow Math. J., 19 (1978), no. 2, 163-166.
3. N. Alon, B. Mohar, D. P. Sanders, On acyclic colorings of graphs on surfaces. Israel J. Math., 94 (1996), 273-283.
4. N. Alon, C. McDiarmid, B. Reed, Acyclic coloring of graphs. Random Structures Algorithms 2 (1991), no. 3, 277-288.
5. O. V. Borodin, On acyclic colorings of planar graphs. Discrete Math., 25 (1979), no. 3, 211-236.
6. O. V. Borodin, A. V. Kostochka, D. R. Woodall, Acyclic colourings of planar graphs with large girth. J. London Math. Soc. (2) 60 (1999), 344-352.
7. R. Diestel, Graph Theory, Springer graduate texts (1997).
8. G. Fertin, A. Raspaud, B. Reed, On star coloring of graphs. in Graph-Theoretic Concepts in Computer Science, 27th International Workshop, WG 2001, Springer Lecture Notes in Computer Science 2204 (2001), 140-153.
9. H. Grötzsch, Ein Dreifarbensatz für dreikreisfreie Netze auf der Kugel. Wiss Z. Martin-Luther-U., Halle-Wittenberg, Math.-Nat. Reihe 8 (1959), 109-120.
10. B. Grünbaum, Acyclic colorings of planar graphs. Israel J. Math. 14 (1973), 390-408.
11. H. A. Kierstead, Weak acyclic coloring and asymmetric coloring games, preprint.
12. A. V. Kostochka, Acyclic 6-coloring of planar graphs. (Russian) Diskret. Analiz Vyp. 28 Metody Diskretnogo Analiza v Teorii Grafov i Logiceskih Funkcii, 79 (1976), 40-54,
13. A. V. Kostochka, L. S. Melnikov, Note to the paper of Grünbaum on acyclic colorings. Discrete Math., 14 (1976), 403-406.
14. J. Mitchem, Every planar graph has an acyclic 8-coloring. Duke Math. J., 41 (1974), 177-181.
15. J. Nešetřil and P. Ossona de Mendez, Colorings and homomorphisms of minor closed classes, Discrete and Computational Geometry: The Goodman-Pollack Festschrift (ed. B. Aronov, S. Basu, J. Pach, M. Sharir), Springer Verlag 2003, 651-664.