Acyclic colourings of planar graphs with large girth

Journal of the London Mathematical Society

Volumn 60, Issue 2, 1999, Pages 344-352

  Borodin, O V ^a   Kostochka, A V ^b   Woodall, D R ^c  

^a SOBOLEV INSTITUTE OF MATHEMATICS   (Russian Federation)

^b NOVOSIBIRSK STATE UNIVERSITY   (Russian Federation)

^c NONE

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0005272838     PISSN: 00246107     EISSN: None     Source Type: Journal    
DOI: 10.1112/S0024610799007942     Document Type: Article

References (10)

1. M. O. ALBERTSON and D. BERMAN, 'Every planar graph has an acyclic 7-coloring', Israel J. Math. 28 (1977) 169-177.
2. I. ALGOR and N. ALON, 'The star arboricity of graphs', Discrete Math. 75 (1989) 11-22.
3. O. V. BORODIN, 'A proof of B. Grünbaum's conjecture on acyclic 5-colourability of planar graphs', Dokl. Akad. Nauk SSSR 231 (1976) 18-20 (Russian).
4. O. V. BORODIN, 'On acyclic coloring of planar graphs', Discrete Math. 25 (1979) 211-236.
5. B. GRÜNBAUM, 'Acyclic colorings of planar graphs', Israel J. Math. 14 (1973) 390-408.
6. T. JENSEN and B. TOFT, Graph coloring problems (John Wiley, New York, 1995) 38-39.
7. A. V. KOSTOCHKA, 'Acyclic 6-coloring of planar graphs', Metody Diskret. Anal. 28 (1976) 40-56 (Russian).
8. A. V. KOSTOCHKA and L. S. MELNIKOV, 'Note to the paper of Grünbaum on acyclic colorings', Discrete Math. 14 (1976) 403-406.
9. J. MITCHEM, 'Every planar graph has an acyclic 8-coloring', Duke Math. J. 14 (1974) 177-181.
10. A. RASPAUD and E. SOPENA, 'Good and semi-strong colorings of oriented planar graphs', Inform. Process. Lett. 51 (1994) 171-174.