Y. Aubry, J. Godin, and O. Togni, Choosability of a weighted path and free-choosability of a cycle, 2010.
URL : https://hal.archives-ouvertes.fr/hal-00484445

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

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, 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, Choosability of the square of planar subcubic graphs with large girth, Discrete Math, pp.3553-3563, 2009.

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

. 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.