Abstract
We give upper bounds for the generalised acyclic chromatic number and generalised acyclic edge chromatic number of graphs with maximum degree d, as a function of d. We also produce examples of graphs where these bounds are of the correct order.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Alon, N., McDiarmid, C., Reed, B.: Acyclic colouring of graphs. Random Struct. Algor. 2, 277–288 (1991)
Alon, N., Mohar, B., Sanders, D.P.: On acyclic colorings of graphs on surfaces. Israel J. Math. 94, 273–283 (1996)
Benson, C.T.: Minimal regular graphs of girths eight and twelve. Canadian J. Math. 26, 1091–1094 (1966)
Bollobás, B.: Random Graphs, 2nd edn., Cambridge University Press, Cambridge, 2001
Borodin, O.: On acyclic colorings of planar graphs. Discrete Math. 25, 211–236 (1979)
Gerke, S., Greenhill, C., Wormald, N.C.: The generalised acyclic edge chromatic number of random regular graphs. Preprint, 2002
Grünbaum, B.: Acyclic colorings of planar graphs. Israel J. Math. 14, 390–408 (1973)
Molloy, M., Reed, B.: Further algorithmic aspects of the Local Lemma, in: Proceedings of the 30th Annual ACM Symposium on the Theory of Computing, pp 524–529, 1998
Nešetřil, J., Wormald, N.C.: The acyclic edge chromatic number of a random d-regular graph is d+1. J. Graph Theory 49, 69–74 (2005)
Author information
Authors and Affiliations
Corresponding author
Additional information
Part of this work supported by an Australian Research Council Postdoctoral Fellowship
Rights and permissions
About this article
Cite this article
Greenhill, C., Pikhurko, O. Bounds on the Generalised Acyclic Chromatic Numbers of Bounded Degree Graphs. Graphs and Combinatorics 21, 407–419 (2005). https://doi.org/10.1007/s00373-005-0635-y
Received:
Accepted:
Issue Date:
DOI: https://doi.org/10.1007/s00373-005-0635-y