N. Alon, . Zs, M. Tuza, and . Voigt, Choosability and fractional chromatic number, Discrete Math, pp.31-38, 1997.
DOI : 10.1016/s0012-365x(96)00159-8
URL : http://doi.org/10.1016/s0012-365x(96)00159-8

O. V. Borodin, A. V. Kostochka, and D. R. Woodall, List Edge and List Total Colourings of Multigraphs, Journal of Combinatorial Theory, Series B, vol.71, issue.2, pp.184-204, 1997.
DOI : 10.1006/jctb.1997.1780

M. M. Cropper, J. L. Goldwasser, A. J. Hilton, D. G. Hoffman, and P. D. Johnson, Extending the disjoint-representatives theorems of Hall, Halmos, and Vaughan to list-multicolorings of graphs, Journal of Graph Theory, vol.128, issue.4, pp.199-219, 2000.
DOI : 10.1002/(SICI)1097-0118(200004)33:4<199::AID-JGT2>3.0.CO;2-7

P. Erd?-os, A. Rubin, and H. Taylor, Choosability in graphs, Proc. West- Coast Conf. on Combinatorics, Graph Theory and Computing, pp.125-157, 1979.

J. Godin, Coloration et choisissabilité des graphes et applications, 2009.

S. Gravier, A Hajós-like theorem for list coloring, Discrete Math, pp.299-302, 1996.

S. Gutner and M. Tarsi, Some results on (a:b)-choosability, Discrete Math, pp.2260-2270, 2009.

F. Havet, Choosability of the square of planar subcubic graphs with large girth, Discrete Mathematics, vol.309, issue.11, pp.3553-3563, 2009.
DOI : 10.1016/j.disc.2007.12.100
URL : https://hal.archives-ouvertes.fr/inria-00496423

F. Havet, Channel assignment and multicolouring of the induced subgraphs of the triangular lattice, Discrete Mathematics, vol.233, issue.1-3, pp.219-233, 2001.
DOI : 10.1016/S0012-365X(00)00241-7

F. Havet and J. Zerovnik, Finding a five bicolouring of a triangle-free subgraph of the triangular lattice, Discrete Mathematics, vol.244, issue.1-3, pp.103-108, 2002.
DOI : 10.1016/S0012-365X(01)00079-6

M. Kchikech and O. Togni, Approximation algorithms for multicoloring powers of square and triangular meshes, Discrete Math. and Theoretical Computer Science, vol.8, issue.1, pp.159-172, 2006.
URL : https://hal.archives-ouvertes.fr/hal-00961107

C. Mcdiarmid and B. Reed, Channel assignement and weighted coloring, pp.36-114, 2000.

K. S. Sudeep and S. Vishwanathan, A technique for multicoloring triangle-free hexagonal graphs, Discrete Math, pp.256-259, 2005.

C. Thomassen, The chromatic number of a graph of girth 5 on a fixed surface, Journal of Combinatorial Theory, Series B, vol.87, issue.1, pp.38-71, 2003.
DOI : 10.1016/S0095-8956(02)00027-8

. Zs, M. Tuza, and . Voigt, Every 2-choosable graph is (2m,m)-choosable, J. Graph Theory, vol.22, pp.245-252, 1996.

V. Vizing, Coloring the vertices of a graph in prescribed colors, Diskret. Analiz. No. Metody Diskret. Anal. v Teorii Kodov i Shem, vol.29, issue.101, pp.3-10, 1976.

M. Voigt, Choosability of planar graphs, Discrete Math, pp.457-460, 1996.

M. Voigt, On list Colourings and Choosability of Graphs, 1998.