1. Every map is four colorable: part 1, discharging;Appel;Illinois Journal of Mathematics,1977
2. Every map is four colorable: part 2, reducibility;Appel;Illinois Journal of Mathematics,1977
3. M. Bonamy, B. Lévêque, A. Pinlou, 2-distance coloring of sparse graphs, Journal of Graph Theory, to appear.
4. Sufficient conditions for 2-distance (Δ+1)-colorability of planar graphs;Borodin;Siberian Electronic Mathematical Reports,2004
5. 2-distance (Δ+2)-coloring of planar graphs with girth six and Δ≥18;Borodin;Discrete Mathematics,2009