The 4-Acyclic Edge Coloring of Graphs with Large Girths

Show more

References

[1] Alon, N., Sudakov, B. and Zaks, A. (2011) Acyclic Edge Colorings of Graphs. Journal of Graph Theory, 37, 157-167.

[2] Gerke, S., Greenhill, C. and Wormald, N. (2006) The Generalised Acyclic Edge Chromatic Number of Random Regular Graphs. Journal of Graph Theory, 52, 101-125.

[3] Gerke, S. and Raemy, M. (2007) Generalised Acyclic Edge Colourings of Graphs with Large Girth. Discrete Mathematics, 307, 1668-1671.

[4] Wu, Y.W. and Yan, G.Y. (2016) Improved Bounds on the Generalized Acyclic Chromatic Number. Acta Mathematicae Applicatae Sinica: English Series, to Appear.

[5] Bondy, J. and Murty, U. (1976) Graph Theory with Applications. MacMillan, London.

[6] Molloy, M. and Reed, B. (2002) Graph Colouring and the Probabilistic Method. Algorithms and Combinatorics. Springer, Berlin.