ISSN 1234-3099 (print version)
ISSN 2083-5892 (electronic version)
SCImago Journal Rank (SJR) 2018: 0.763
Rejection Rate (2018-2019): c. 84%
Discussiones Mathematicae Graph Theory 33(1) (2013)
Dedicated to Mieczysław Borowiecki on the occasion of his 70th birthday
Faculty of Mathematics, Computer Science and Econometrics University of Zielona Góra Z. Szafrana 4a, 65-516 Zielona Góra, Poland
Acyclic colourings were introduced by Grünbaum in 1973, and since then have been widely studied. In particular, the problem of acyclic colourings of graphs with bounded maximum degree has been investigated. In 2011, Kostochka and Stocker showed that any graph with maximum degree 5 can be acyclically coloured with at most 7 colours. The question, whether this bound is achieved, remains open. In this note we prove that any graph with maximum degree 5 and maximum average degree at most 4 admits an acyclic 6-colouring. We also provide examples of graphs with these properties.
Keywords: acyclic colouring, bounded degree graph, maximum average degree
2010 Mathematics Subject Classification: 05C15.
Received 14 July 2012 Revised 14 November 2012 Accepted 15 November 2012