Cranston, Daniel W.; West, Douglas B. An introduction to the discharging method via graph coloring. (English) Zbl 1355.05104 Discrete Math. 340, No. 4, 766-793 (2017). MSC: 05C15 05C10 05C07 PDF BibTeX XML Cite \textit{D. W. Cranston} and \textit{D. B. West}, Discrete Math. 340, No. 4, 766--793 (2017; Zbl 1355.05104) Full Text: DOI arXiv
Kim, Jaehoon; Kostochka, Alexandr; Zhu, Xuding Improper coloring of sparse graphs with a given girth. II: Constructions. (English) Zbl 1333.05115 J. Graph Theory 81, No. 4, 403-413 (2016). MSC: 05C15 05C42 PDF BibTeX XML Cite \textit{J. Kim} et al., J. Graph Theory 81, No. 4, 403--413 (2016; Zbl 1333.05115) Full Text: DOI
Glebov, A. N.; Zambalaeva, D. Zh. Partition of a planar graph with girth 6 into two forests with chain length at most 4. (Russian, English) Zbl 1324.05034 Diskretn. Anal. Issled. Oper. 21, No. 2, 33-51 (2014); translation in J. Appl. Ind. Math. 8, No. 3, 317-328 (2014). MSC: 05C10 05C38 05C70 PDF BibTeX XML Cite \textit{A. N. Glebov} and \textit{D. Zh. Zambalaeva}, Diskretn. Anal. Issled. Oper. 21, No. 2, 33--51 (2014; Zbl 1324.05034); translation in J. Appl. Ind. Math. 8, No. 3, 317--328 (2014) Full Text: DOI
Kim, Jaehoon; Kostochka, Alexandr; Zhu, Xuding Improper coloring of sparse graphs with a given girth. I: \((0,1)\)-colorings of triangle-free graphs. (English) Zbl 1297.05083 Eur. J. Comb. 42, 26-48 (2014). MSC: 05C15 05C42 05C10 05C35 PDF BibTeX XML Cite \textit{J. Kim} et al., Eur. J. Comb. 42, 26--48 (2014; Zbl 1297.05083) Full Text: DOI
Borodin, O. V.; Kostochka, A. V. Defective 2-colorings of sparse graphs. (English) Zbl 1282.05041 J. Comb. Theory, Ser. B 104, 72-80 (2014). MSC: 05C15 05C42 05C35 05C07 PDF BibTeX XML Cite \textit{O. V. Borodin} and \textit{A. V. Kostochka}, J. Comb. Theory, Ser. B 104, 72--80 (2014; Zbl 1282.05041) Full Text: DOI
Borodin, O. V.; Kostochka, A.; Yancey, M. On 1-improper 2-coloring of sparse graphs. (English) Zbl 1281.05060 Discrete Math. 313, No. 22, 2638-2649 (2013). MSC: 05C15 05C42 05C10 05C35 PDF BibTeX XML Cite \textit{O. V. Borodin} et al., Discrete Math. 313, No. 22, 2638--2649 (2013; Zbl 1281.05060) Full Text: DOI
Esperet, Louis; Montassier, Mickaël; Ochem, Pascal; Pinlou, Alexandre A complexity dichotomy for the coloring of sparse graphs. (English) Zbl 1264.05049 J. Graph Theory 73, No. 1-2, 85-102 (2013). MSC: 05C15 05C83 PDF BibTeX XML Cite \textit{L. Esperet} et al., J. Graph Theory 73, No. 1--2, 85--102 (2013; Zbl 1264.05049) Full Text: DOI
Borodin, O. V.; Ivanova, A. O.; Montassier, M.; Raspaud, A. \((k,1)\)-coloring of sparse graphs. (English) Zbl 1238.05084 Discrete Math. 312, No. 6, 1128-1135 (2012). MSC: 05C15 05C42 05C10 PDF BibTeX XML Cite \textit{O. V. Borodin} et al., Discrete Math. 312, No. 6, 1128--1135 (2012; Zbl 1238.05084) Full Text: DOI
Borodin, O. V.; Ivanova, A. O.; Montassier, M.; Raspaud, A. \((k,j)\)-coloring of sparse graphs. (English) Zbl 1239.05059 Discrete Appl. Math. 159, No. 17, 1947-1953 (2011). MSC: 05C15 05C42 90C05 05C35 05C07 PDF BibTeX XML Cite \textit{O. V. Borodin} et al., Discrete Appl. Math. 159, No. 17, 1947--1953 (2011; Zbl 1239.05059) Full Text: DOI
Borodin, O. V.; Kostochka, A. V. Vertex decompositions of sparse graphs into an independent vertex set and a subgraph of maximum degree at most 1. (English) Zbl 1232.05073 Sib. Math. J. 52, No. 5, 796-801 (2011); translation from Sib. Mat. Zh. 52, No. 5, 1004-1011 (2011). MSC: 05C15 05C70 PDF BibTeX XML Cite \textit{O. V. Borodin} and \textit{A. V. Kostochka}, Sib. Math. J. 52, No. 5, 796--801 (2011; Zbl 1232.05073); translation from Sib. Mat. Zh. 52, No. 5, 1004--1011 (2011) Full Text: DOI
Borodin, Oleg V.; Ivanova, Anna O. List strong linear 2-arboricity of sparse graphs. (English) Zbl 1218.05038 J. Graph Theory 67, No. 2, 83-90 (2011). MSC: 05C10 05C15 05C07 PDF BibTeX XML Cite \textit{O. V. Borodin} and \textit{A. O. Ivanova}, J. Graph Theory 67, No. 2, 83--90 (2011; Zbl 1218.05038) Full Text: DOI
Montassier, Mickael; Raspaud, André; Zhu, Xuding Decomposition of sparse graphs into two forests, one having bounded maximum degree. (English) Zbl 1234.05190 Inf. Process. Lett. 110, No. 20, 913-916 (2010). MSC: 05C70 05C85 PDF BibTeX XML Cite \textit{M. Montassier} et al., Inf. Process. Lett. 110, No. 20, 913--916 (2010; Zbl 1234.05190) Full Text: DOI
Borodin, O. V.; Ivanova, A. O.; Montassier, M.; Ochem, P.; Raspaud, A. Vertex decompositions of sparse graphs into an edgeless subgraph and a subgraph of maximum degree at most \(k\). (English) Zbl 1209.05177 J. Graph Theory 65, No. 2, 83-93 (2010). MSC: 05C70 05C15 PDF BibTeX XML Cite \textit{O. V. Borodin} et al., J. Graph Theory 65, No. 2, 83--93 (2010; Zbl 1209.05177) Full Text: DOI