1. Alon, N., Tuza, Zs, Voigt, M.: Choosability and fractional chromatic number. Discret. Math. 165(166), 31–38 (1997)
2. Aubry, Y., Godin, J.-C., Togni, O.: Every triangle-free induced subgraph of the triangular lattice is $$(5m,2m)$$ ( 5 m , 2 m ) -choosable. Discret. Appl. Math. 166, 51–58 (2014)
3. Graduate Texts in Mathematics;JA Bondy,2008
4. Erdős, P., Rubin, A.L., Taylor, H.: Choosability in graphs. In: Proceedings of the West-Coast Conference on Combinatorics, Graph Theory and Computing, Congressus Numerantium XXVI, pp. 125–157 (1979)
5. Godin, J.-C.: Coloration et choisissabilité des graphes et applications. PhD Thesis (in french), Université du Sud Toulon-Var, France (2009)