N. Alon and M. Krivelevich, The choice number of random bipartite graphs, Annals of Combinatorics, vol.101, issue.29, pp.291-297, 1998.
DOI : 10.1007/BF01608526

N. Alon, M. Krivelevich, and B. Sudakov, List Coloring of Random and Pseudo-Random Graphs, Combinatorica, vol.19, issue.4, pp.453-472, 1999.
DOI : 10.1007/s004939970001

J. H. Alon and . Spencer, The probabilistic method, 2004.

D. Bokal, G. Fijav?, M. Juvan, P. M. Kayll, and B. Mohar, The circular chromatic number of a digraph, Journal of Graph Theory, vol.229, issue.3, pp.227-240, 2004.
DOI : 10.1016/S0012-365X(00)00217-X

P. Erd?s, Problems and results in number theory and graphs theory, Proceedings of the 9th Manitoba Conference on Numerical Mathematics and Computing, pp.3-21, 1979.

P. Erd?s, J. Gimbel, and D. Kratsch, Some extremal results in cochromatic and dichromatic theory, Journal of Graph Theory, vol.18, issue.6, pp.579-585, 1991.
DOI : 10.1002/jgt.3190150604

P. Erd?s and L. Moser, On the representation of directed graphs as unions of orderings, Magyar Tud. Akad. Mat. Kutato Int. Kozl, vol.9, pp.125-132, 1964.

P. Erd?s, A. L. Rubin, and H. Taylor, Choosability in graphs, Proceedings of the West Coast Conference on Combinatorics, Graph Theory and Computing, Congressus Numerantium 26, pp.125-157, 1979.

A. Harutyunyan, Brooks-type results for coloring of digraphs, 2011.

A. Harutyunyan and B. Mohar, Strengthened Brooks Theorem for digraphs of girth three, Electronic Journal of Combinatorics, vol.18, p.195, 2011.

A. Harutyunyan and B. Mohar, Gallai's Theorem for List Coloring of Digraphs, SIAM Journal on Discrete Mathematics, vol.25, issue.1, pp.170-180, 2011.
DOI : 10.1137/100803870

A. Harutyunyan and B. Mohar, Two results on the digraph chromatic number, Discrete Mathematics, vol.312, issue.10, pp.3121823-1826, 2012.
DOI : 10.1016/j.disc.2012.01.028
URL : https://doi.org/10.1016/j.disc.2012.01.028

A. Harutyunyan and B. Mohar, Planar Digraphs of Digirth Five Are 2-Colorable, Journal of Graph Theory, vol.33, issue.4
DOI : 10.1016/0095-8956(82)90046-6

A. Johansson, Asymptotic choice number for triangle free graphs, 1996.

K. Ohba, On chromatic-choosable graphs, Journal of Graph Theory, vol.29, issue.166, pp.130-135, 2002.
DOI : 10.1112/jlms/s1-10.37.26

U. Manber and M. Tompa, The Effect of Number of Hamiltonian Paths on the Complexity of a Vertex-Coloring Problem, SIAM Journal on Computing, vol.13, issue.1, pp.109-115, 1984.
DOI : 10.1137/0213008

B. Mohar, Circular colorings of edge-weighted graphs, Journal of Graph Theory, vol.229, issue.2, pp.107-116, 2003.
DOI : 10.1016/S0012-365X(00)00217-X

B. Mohar, Eigenvalues and colorings of digraphs, Linear Algebra and its Applications, vol.432, issue.9, pp.2273-2277, 2010.
DOI : 10.1016/j.laa.2009.05.027
URL : https://doi.org/10.1016/j.laa.2009.05.027

M. Molloy and B. Reed, Graph colouring and the probabilistic method, 2002.
DOI : 10.1007/978-3-642-04016-0

V. Neumann-lara, The dichromatic number of a digraph, Journal of Combinatorial Theory, Series B, vol.33, issue.3, pp.265-270, 1982.
DOI : 10.1016/0095-8956(82)90046-6

V. Neumann-lara, Vertex colourings in digraphs. Some Problems, 1985.

J. A. Noel, B. A. Reed, and H. Wu, A Proof of a Conjecture of Ohba, Journal of Graph Theory, vol.288, issue.2, pp.86-102, 2014.
DOI : 10.7151/dmgt.1049

J. Spencer and C. Subramanian, On the size of induced acyclic subgraphs in random digraphs, Discrete Mathematics and Theoretical Computer Science, vol.10, issue.2, pp.47-54, 2008.
URL : https://hal.archives-ouvertes.fr/hal-00972323