K. Appel and W. Haken, Every planar map is four colorable. Part I. Discharging, Illinois J. Math, vol.21, pp.429-490, 1977.

K. Appel and W. Haken, Every planar map is four colorable. Part II, Reducibility. Illinois J. Math, vol.21, pp.491-567, 1977.

O. V. Borodin and A. O. Ivanova, Near proper 2-coloring the vertices of sparse graphs, Diskretn. Anal. Issled. Oper, vol.16, issue.2, pp.16-20, 2009.

O. V. Borodin, A. O. Ivanova, M. Montassier, P. Ochem, and A. Raspaud, Vertex decompositions of sparse graphs into an edgeless subgraph and a subgraph of maximum degree at most k, Journal of Graph Theory, vol.31, issue.2, pp.83-93, 2010.
DOI : 10.1002/jgt.20467
URL : https://hal.archives-ouvertes.fr/hal-00377372

O. V. Borodin, A. O. Ivanova, M. Montassier, and A. Raspaud, <mml:math altimg="si17.gif" display="inline" overflow="scroll" xmlns:xocs="http://www.elsevier.com/xml/xocs/dtd" xmlns:xs="http://www.w3.org/2001/XMLSchema" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns="http://www.elsevier.com/xml/ja/dtd" xmlns:ja="http://www.elsevier.com/xml/ja/dtd" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:tb="http://www.elsevier.com/xml/common/table/dtd" xmlns:sb="http://www.elsevier.com/xml/common/struct-bib/dtd" xmlns:ce="http://www.elsevier.com/xml/common/dtd" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:cals="http://www.elsevier.com/xml/common/cals/dtd"><mml:mrow><mml:mo>(</mml:mo><mml:mi>k</mml:mi><mml:mo>,</mml:mo><mml:mn>1</mml:mn><mml:mo>)</mml:mo></mml:mrow></mml:math>-coloring of sparse graphs, Discrete Mathematics, vol.312, issue.6, pp.1128-1135, 2012.
DOI : 10.1016/j.disc.2011.11.031

O. V. Borodin, A. O. Ivanova, M. Montassier, and A. Raspaud, <mml:math altimg="si11.gif" display="inline" overflow="scroll" xmlns:xocs="http://www.elsevier.com/xml/xocs/dtd" xmlns:xs="http://www.w3.org/2001/XMLSchema" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns="http://www.elsevier.com/xml/ja/dtd" xmlns:ja="http://www.elsevier.com/xml/ja/dtd" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:tb="http://www.elsevier.com/xml/common/table/dtd" xmlns:sb="http://www.elsevier.com/xml/common/struct-bib/dtd" xmlns:ce="http://www.elsevier.com/xml/common/dtd" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:cals="http://www.elsevier.com/xml/common/cals/dtd"><mml:mrow><mml:mo>(</mml:mo><mml:mi>k</mml:mi><mml:mo>,</mml:mo><mml:mi>j</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math>-coloring of sparse graphs, Discrete Applied Mathematics, vol.159, issue.17, pp.1947-1953, 2011.
DOI : 10.1016/j.dam.2011.06.021

O. V. Borodin and A. V. Kostochka, Vertex partitions of sparse graphs into an independent vertex set and subgraph of maximum degree at most one, Sibirsk. Mat. Zh, vol.52, issue.5, pp.1004-1010, 2011.

O. V. Borodin and A. V. Kostochka, Defective 2-colorings of sparse graphs, Journal of Combinatorial Theory, Series B, vol.104, pp.72-80, 2014.
DOI : 10.1016/j.jctb.2013.10.002
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.224.8075

O. V. Borodin, A. V. Kostochka, and M. Yancey, On -improper -coloring of sparse graphs, Discrete Mathematics, vol.313, issue.22, pp.3132638-2649, 2013.
DOI : 10.1016/j.disc.2013.07.014

G. J. Chang, F. Havet, M. Montassier, and A. Raspaud, Steinberg's Conjecture and near-colorings, 2011.

H. Choi, I. Choi, J. Jeong, and G. Suh, (1, k)-coloring of graphs with girth at least 5 on a surface

I. Choi and A. Raspaud, Planar graphs with girth at least 5 are (3,5)-colorable, Discrete Math, vol.318, issue.4, pp.661-667, 2015.

L. J. Cowen, R. H. Cowen, and D. R. Woodall, Defective colorings of graphs in surfaces: Partitions into subgraphs of bounded valency, Journal of Graph Theory, vol.1, issue.2, pp.187-195, 1986.
DOI : 10.1002/jgt.3190100207

P. Dorbec, T. Kaiser, M. Montassier, and A. Raspaud, Limits of Near-Coloring of Sparse Graphs, Journal of Graph Theory, vol.214, issue.2, pp.191-202, 2014.
DOI : 10.1002/jgt.21731
URL : https://hal.archives-ouvertes.fr/hal-00911263

N. Eaton and T. Hull, Defective list colorings of planar graphs, Bull. Inst. Combin. Appl, vol.25, pp.79-87, 1999.

L. Esperet, M. Montassier, P. Ochem, and A. Pinlou, A Complexity Dichotomy for the Coloring of Sparse Graphs, Journal of Graph Theory, vol.8, issue.2, pp.85-102, 2013.
DOI : 10.1002/jgt.21659
URL : https://hal.archives-ouvertes.fr/lirmm-00736468

J. Fiala, K. Jansen, V. B. Le, and E. Seidel, Graph Subcolorings: Complexity and Algorithms, SIAM Journal on Discrete Mathematics, vol.16, issue.4, pp.635-650, 2003.
DOI : 10.1137/S0895480101395245
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.218.5397

M. R. Garey, D. S. Johnson, and L. J. Stockmeyer, Some simplified NP-complete graph problems, Theoretical Computer Science, vol.1, issue.3, pp.237-267, 1976.
DOI : 10.1016/0304-3975(76)90059-1
URL : http://doi.org/10.1016/0304-3975(76)90059-1

J. Gimbel and C. Hartman, Subcolorings and the subchromatic number of a graph, Discrete Mathematics, vol.272, issue.2-3, pp.139-154, 2003.
DOI : 10.1016/S0012-365X(03)00177-8

A. N. Glebov, D. Zh, and . Zambalaeva, Path partitions of planar graphs, Sib. Elektron. Mat. Izv, vol.4, pp.450-459, 2007.

F. Havet and J. Sereni, Improper choosability of graphs and maximum average degree, Journal of Graph Theory, vol.146, issue.3, pp.181-199, 2006.
DOI : 10.1002/jgt.20155
URL : https://hal.archives-ouvertes.fr/inria-00071425

J. Kim, A. V. Kostochka, and X. Zhu, Improper coloring of sparse graphs with a given girth, I: (0,1)-colorings of triangle-free graphs, European Journal of Combinatorics, vol.42, pp.26-48, 2014.
DOI : 10.1016/j.ejc.2014.05.003

R. Skrekovski, List Improper Colourings of Planar Graphs, Combinatorics, Probability and Computing, vol.8, issue.3, pp.293-299, 1999.
DOI : 10.1017/S0963548399003752