Alon,N; McDiarmid,C; Reed,B. Acyclic colourings of graphs. Random
Structures and Algorithms. 2, 277-288,1990.
 Borodin,O.V; Kostochka,A.V; Raspaud,A; Sopena,E. Acyclic colouring
of 1-planar graphs. Discrete Applied Mathematics. 114(1-3) ,29-41,2001.
 Borodin,O.V; Kostochka,A.V; Woodall,D.R. Acyclic colourings of planar
graphs with large girth.J. London Math. Soc. 60(2), 344-352,1999.
 Borodin,O.V. On acyclic colorings of planar graphs. Discrete Mathematics.
 Burstein,M.I. Every 4-valent graph has an acyclic 5 coloring (in russian).
Soob's'c Akad. Nauk Gruzin. SSR 93, 21-24,1979.
 Fertin,G; Godard,E; Raspaud,A. Acyclic and k-distance coloring of the
grid. Information Processing Letters. 87(1), 51-58,2003.
 Fertin,G; Raspaud,A. Acyclic Coloring of Graphs of Maximum Degree
Five:Nine Colors are Enough. Information Processing Letters. 105(2),
 Grunbaum,B. Acyclic colorings of planar graphs. Israel J.Math. 14(3),
 Jamison, R.E; Matthews,G.L; Villalpando,J. Acyclic colorings of products
of trees. Information Processing Letters. 99(1), 7-12,2006.
 Skulrattanakulchai,S. Acyclic colorings of subcubic graphs. Information
Processing Letters. 92(4), 161-167,2004.
 Sopena,E. The chromatic number of oriented graphs. Mathematical
 Yadav,k ; Varagani,s; Kothapalli,k; Venkaiah,V. Ch. Acyclic Vertex
Coloring of Graphs of Maximum Degree 5. Proc. of the International
Conference on Graph Theory and its Applications,2008, Coimbatore,
India. (Under submission to Discrete Mathematics, 2009).