N. Alon, C. J. Mcdiarmid, and B. Reed, Acyclic coloring of graphs, Random Struct Algorithm, vol.2, issue.3, pp.277-288, 1991.

S. Bessy, F. Havet, and E. Birmelé, Arc-chromatic number of digraphs in which each vertex has bounded outdegree or bounded indegree, J Graph Theory, vol.53, issue.4, pp.315-332, 2006.
URL : https://hal.archives-ouvertes.fr/inria-00070639

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

O. V. Borodin and A. O. Ivanova, An oriented 7-colouring of planar graphs with girth at least 7, Sib Electron Math Reports, vol.2, pp.222-229, 2005.

O. V. Borodin and A. O. Ivanova, An oriented colouring of planar graphs with girth at least 4, Sib Electron Math Reports, vol.2, pp.239-249, 2005.

O. V. Borodin, A. V. Kostochka, J. Ne?et?il, A. Raspaud, and . Sopena, On the maximum average degree and the oriented chromatic number of a graph, Discrete Math, vol.206, pp.77-89, 1999.
URL : https://hal.archives-ouvertes.fr/hal-00306484

B. Courcelle, The monadic second order-logic of graphs VI: On several representations of graphs by relational structures, Discrete Appl Math, vol.54, pp.117-149, 1994.

J. Culus and M. Demange, Oriented coloring: Complexity and approximation, SOFSEM, vol.3831, pp.226-236, 2006.
URL : https://hal.archives-ouvertes.fr/hal-00134825

D. Gonçalves, M. A. Shalu, and A. Raspaud, On oriented labelling parameters, Series in Machine Perception and artificial Intelligence, vol.66, pp.34-45, 2005.

B. Guiduli, On incidence coloring and star arboricity of graphs, Discrete Math, vol.163, pp.275-278, 1997.

C. C. Harner and R. C. Entringer, Arc colorings of digraphs, J Combin Theory B, vol.13, pp.219-225, 1972.

P. Hell and J. Ne?et?il, Oxford Lecture Series in Mathematics and its Applications, vol.28, 2004.

H. Kawai, N. Fujikake, and Y. Shibata, Factorization of de bruijn digraphs by cycle-rooted trees, Inform Process Lett, vol.77, issue.5-6, pp.269-275, 2001.

W. F. Klostermeyer and G. Macgillivray, Homomorphisms and oriented colorings of equivalence classes of oriented graphs, Discrete Math, vol.274, issue.1-3, pp.161-172, 2004.

A. V. Kostochka, É. Sopena, and X. Zhu, Acyclic and oriented chromatic numbers of graphs, J Graph Theory, vol.24, pp.331-340, 1997.

T. H. Marshall, Homomorphism bounds for oriented planar graphs, J Graph Theory JGT, vol.55, issue.3, pp.175-190, 2007.

J. Ne?et?il, A. Raspaud, and . Sopena, Colorings and girth of oriented planar graphs, Discrete Math, pp.519-530, 1997.

P. Ochem, Negative results on acyclic improper colorings, European Conference on Combinatorics, Graph Theory and Applications (EuroComb'05), vol.AE, pp.357-362, 2005.
URL : https://hal.archives-ouvertes.fr/hal-01184430

A. Pinlou, On oriented arc-coloring of subcubic graphs, Elect J Comb, vol.13, issue.1, 2006.
URL : https://hal.archives-ouvertes.fr/hal-00307094

A. Pinlou and . Sopena, Oriented vertex and arc colorings of outerplanar graphs, Inform Process Lett, vol.100, issue.3, pp.97-104, 2006.
URL : https://hal.archives-ouvertes.fr/hal-00307093

A. Raspaud and . Sopena, Good and semi-strong colorings of oriented planar graphs, Inform Process Lett, vol.51, issue.4, pp.171-174, 1994.

É. Sopena, The chromatic number of oriented graphs, J Graph Theory, vol.25, pp.191-205, 1997.
URL : https://hal.archives-ouvertes.fr/hal-00307541

É. Sopena, Oriented graph coloring, Discrete Math, vol.229, issue.1-3, pp.359-369, 2001.

D. R. Wood, Acyclic, star and oriented colourings of graph subdivisions, Discrete Math Theoret Comput Sci, vol.7, issue.1, pp.37-50, 2005.
URL : https://hal.archives-ouvertes.fr/hal-00959027