1. Bonamy, M., Kang, R.: List coloring with a bounded palette. J. Graph Theory 84, 93–103 (2017)
2. Demange, M., de Werra, D.: Complexity of choosability with a small palette of colors. (preprint) (2017) arXiv:1601.01768
3. Erdős, P.: Problem 9. In: Fiedler, M. (ed.), Theory of Graphs and Its Applications, Proc. Sympos., Smolenice, 1963, Publ. House Czechoslovak Acad. Sci. Prague, 159 (1964)
4. Erdős, P., Rubin, A.L., Taylor, H.: Choosability in graphs. Cong. Numer. 26, 125–127 (1979)
5. Hajnál, A., Szemerédi, E.: Proof of a conjecture of Erdős. In: Rényi, A., Sós, V.T. (eds.) Combinatorial Theory and Its Applications, vol. II, pp. 601–623. North-Holland, Amsterdam (1970)