1. Every map is four colorable: Part 1;Appel;Discharging, Illinois J Math,1977
2. Every map is four colorable: Part 2, Reducibility;Appel;Illinois J Math,1977
3. 2-distance coloring of sparse graphs;Bonamy;Electron Notes Discrete Math,2011
4. On the total coloring of planar graphs;Borodin;J Reine Angew Math,1989
5. Sufficient conditions for the 2-distance (Δ+1)-colorability of plane graphs (in Russian);Borodin;Siberian Electron Math Rep,2004