1. On a generalization of chromatic number;Andrews;Congr. Numer.,1985
2. Every planar map is four colorable. I. Discharging;Appel;Illinois J. Math.,1977
3. Every planar map is four colorable. II. Reducibility;Appel;Illinois J. Math.,1977
4. Vertex decompositions of sparse graphs into an edgeless subgraph and a subgraph of maximum degree at most k;Borodin;J. Graph Theory,2010
5. Defective 2-colorings of sparse graphs;Borodin;J. Combin. Theory Ser. B,2014