1. Alon, N., McDiarmid, C., Reed, B. Acyclic coloring of graphs. Random Structures and Algotithms, 2: 277–288 (1991)
2. Bondy, J.A., Murty, U.S.R. Graph Theory with Applications. Macmillan Press, New York, 1976
3. Cai, J., Wang, G., Yan, G. The generalized acyclic chromatic number of graphs with large girth. Acta Mathematics Sinica, 56: 27–30 (2013) (in Chinese)
4. Erdös, P., Spencer, J. Lopsided Lovász Local Lemma and Latin transversals. Discrete Appl. Math., 30: 151–154 (1991)
5. Goncalves, D., Montassier, M., Pinlou, A. Entropy compression method applied to graph coloring. arXiv: 1406.4380vl