1. Chromatic number, independence ratio, and crossing number;Albertson;Ars Math. Contemp.,2008
2. M. Albertson, Colorings and crossings, presentation at SIAM conference on discrete mathematics 2008, Burlington, VT.
3. O. Amini, L. Esperet, J. van den Heuvel, A unified approach to distance-two colouring of planar graphs, Manuscript.
4. Every planar map is four colorable;Appel;Bull. Amer. Math. Soc.,1976
5. Solution of Ringel’s problems on vertex-face coloring of plane graphs and coloring of 1-planar graphs;Borodin;Met. Discret. Anal. Novosibirsk,1984