1. Dirac’s Map-color theorem for choosability;Bohme;Journal of Graph Theory,1999
2. J. Carraher, S. Loeb, T. Mahoney, G. Puleo, M.-T. Tsai, D. West, Extending graph choosability results to paintability, Manuscript, 2011.
3. Graph Theory;Diestel,2005
4. The complexity of some graph colouring problems;Edwards;Discrete Applied Mathematics,1992
5. P. Erdős, A.L. Rubin, H. Taylor, Choosability in graphs, in: Proc. West Coast Conf. on Combinatorics, Graph Theory and Computing, Congressus Numerantium, Vol. XXVI, 1979, pp. 125–157.