G. G. Albertson, H. A. Chappell, A. Kierstead, R. Kündgen, and . Ramamurthi, Coloring with no 2-colored P 4 's, 2002.

C. [. Alon, B. Mcdiarmid, and . Reed, Acyclic coloring of graphs. Random Structures and Algorithms, pp.277-288, 1991.

O. V. Borodin, A. V. Kostochka, A. Raspaud, and E. Sopena, Acyclick-strong coloring of maps on surfaces, Mathematical Notes, vol.6, issue.4, pp.29-35, 2000.
DOI : 10.1007/BF02675788

O. V. Borodin, A. V. Kostochka, and D. R. Woodall, Acyclic Colourings of Planar Graphs with Large Girth, Journal of the London Mathematical Society, vol.60, issue.2, pp.344-352, 1999.
DOI : 10.1112/S0024610799007942

H. L. Bodlander, A partial k-arboretum of graphs with bounded treewidth, Theoretical Computer Science, vol.209, issue.1-2, pp.1-45, 1998.
DOI : 10.1016/S0304-3975(97)00228-4

]. B. Bol85 and . Bollobás, Random Graphs, 1985.

]. O. Bor79 and . Borodin, On acyclic colorings of planar graphs, Discrete Mathematics, vol.25, pp.211-236, 1979.

P. Erdös and L. Lovász, Infinite and finite sets, 1975.

E. [. Fertin, A. Godard, and . Raspaud, Acyclic and k-distance coloring of the grid, Information Processing Letters, vol.87, issue.1, pp.51-58, 2003.
DOI : 10.1016/S0020-0190(03)00232-1
URL : https://hal.archives-ouvertes.fr/hal-00307787

]. B. Grü73 and . Grünbaum, Acyclic colorings of planar graphs, McMorris. Topics in intersection graph theory. SIAM Monographs on D.M. and Applications, pp.390-408, 1973.

J. Ne?et?il, P. Ossona, and . Mendez, Colorings and Homomorphisms of Minor Closed Classes, 2001.
DOI : 10.1007/978-3-642-55566-4_29

P. [. Robertson and . Seymour, Graph minors. I. Excluding a forest, Journal of Combinatorial Theory, Series B, vol.35, issue.1, pp.39-61, 1983.
DOI : 10.1016/0095-8956(83)90079-5

]. J. Spe87 and . Spencer, Vizing. On an estimate of the chromatic class of a p-graph, Ten Lectures on the Probabilistic Method. SIAM Diskrete Analiz, vol.3, pp.25-30, 1964.