1. N. Alon & M. Tarsi: Colorings and orientations of graphs, Combinatorica 12 (1992), 125–134.
2. P. Erdős, A. L. Rubin & H. Taylor: Choosability in graphs, Proc. West Coast Conference on Combinatorics, Graph Theory and Computing, Congressus Numerantium 26 (1979), 125–157.
3. S. Gutner: The complexity of planar graph choosability, Discrete Math. 159 (1996), 119–130.
4. N. Robertson, D. P. Sanders, P. Seymour & R. Thomas: The fourcolour theorem, J. Combinatorial Theory, Ser. B 70 (1997), 2–44.
5. C. Thomassen: Every planar graph is 5-choosable, J. Combinatorial Theory, Ser. B 62 (1994), 180–181.