]. P. Boiron, E. Sopena, and L. Vignal, Acyclic improper colourings of graphs with bounded degree, DI- MACS Series in Discrete Mathematics and Theoretical Computer Science, pp.49-50, 1999.

O. V. Borodin, On acyclic colorings of planar graphs, Discrete Math, pp.211-236, 1979.

O. V. Borodin, A. V. Kostochka, and D. R. Woodall, Acyclic colorings of planar graphs with large girth, J. London Math. Soc, pp.60-344, 1999.

M. I. Burstein, Every 4-valent graph has an acyclic 5-coloring, Soob??. Akad. Gruzin. SSR, vol.93, pp.21-24, 1979.

G. Fertin and A. Raspaud, Acyclic coloring of graphs of maximum degree five: Nine colors are enough, Information Processing Letters, vol.105, issue.2, pp.65-72, 2008.
DOI : 10.1016/j.ipl.2007.08.022
URL : https://hal.archives-ouvertes.fr/hal-00300737

M. R. Garey and D. S. Johnson, Computers and Intractability, A Guide to the Theory of NP- Completeness, 1979.

B. Gr?-unbaum, Acyclic colorings of planar graphs, Israel Journal of Mathematics, vol.58, issue.2, pp.390-412, 1973.
DOI : 10.1007/BF02764716

A. V. Kostochka, Upper bounds of chromatic functions of graphs, 1978.

S. Skulrattanakulchai, Acyclic colorings of subcubic graphs, Information Processing Letters, vol.92, issue.4, pp.161-167, 2004.
DOI : 10.1016/j.ipl.2004.08.002