N. Alon, . Zs, M. Tuza, and . Voigt, Choosability and fractional chromatic number, Discrete Math, pp.31-38, 1997.

Y. Aubry, J. Godin, and O. Togni, Every triangle-free induced subgraph of the triangular lattice is (5m, 2m)-choosable, pp.51-58, 2014.
URL : https://hal.archives-ouvertes.fr/hal-00631398

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. Gutner and M. Tarsi, Some results on (a:b)-choosability, Discrete Math, pp.2260-2270, 2009.

N. Li, X. Meng, and H. Liu, Free Choosability of Outerplanar Graphs, Lecture Notes in Electrical Engineering, vol.113, pp.253-256, 2012.
DOI : 10.1007/978-94-007-2169-2_30

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

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

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