1. K. Appel and W. Haken: Every planar map is four colorable, Part I: Discharging, Illinois J. of Math. 21 (1977), 429–490.
2. K. Appel, W. Haken and J. Koch: Every planar map is four colorable, Part II: Reducibility, Illinois J. of Math. 21 (1977), 491–567.
3. O. Borodin: On acyclic colorings of planar graphs, Discrete Mathematics 25 (1979), 211–236.
4. Z. Dvořák and K. Kawarabayashi: Choosability of planar graphs of girth 5, arXiv:1109.2976 (2011).
5. Z. Dvořák and K. Kawarabayashi: List-coloring embedded graphs, in: Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2013, New Orleans, Louisiana, USA, January 6–8, 2013, SIAM, 2013, 1004–1012.