1. Every planar map is four colorable, I. Discharging;Appel;Illinois J. Math.,1977
2. The solution of the four-color-map problem;Appel;Sci. Am.,1977
3. Colorings of plane graphs: A survey;Borodin;Discrete Math.,2013
4. On choosability with separation of planar graphs without adjacent short cycles;Chen;Bull. Malays. Math. Sci. Soc.,2018
5. P. Erdős, A.L. Rubin, H. Taylor, Choosability in graphs, in: Proceedings of the West Coast Conference on Combinatorics, Graph Theory and Computing, Arcata, California, 1979, Congressus Numeratium XXVI.