Axenovich, Maria; Ueckerdt, Torsten; Weiner, Pascal Splitting planar graphs of girth 6 into two linear forests with short paths. (English) Zbl 1367.05044 J. Graph Theory 85, No. 3, 601-618 (2017). MSC: 05C10 05C12 05C38 05C70 05C15 PDFBibTeX XMLCite \textit{M. Axenovich} et al., J. Graph Theory 85, No. 3, 601--618 (2017; Zbl 1367.05044) Full Text: DOI arXiv
Choi, Hojin; Choi, Ilkyoo; Jeong, Jisu; Suh, Geewon \((1,k)\)-coloring of graphs with girth at least five on a surface. (English) Zbl 1359.05099 J. Graph Theory 84, No. 4, 521-535 (2017). MSC: 05C70 05C07 05C15 PDFBibTeX XMLCite \textit{H. Choi} et al., J. Graph Theory 84, No. 4, 521--535 (2017; Zbl 1359.05099) 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 PDFBibTeX XMLCite \textit{J. Kim} et al., J. Graph Theory 81, No. 4, 403--413 (2016; Zbl 1333.05115) Full Text: DOI
Dorbec, Paul; Kaiser, Tomáš; Montassier, Mickael; Raspaud, André Limits of near-coloring of sparse graphs. (English) Zbl 1280.05040 J. Graph Theory 75, No. 2, 191-202 (2014). MSC: 05C15 05C07 05C35 PDFBibTeX XMLCite \textit{P. Dorbec} et al., J. Graph Theory 75, No. 2, 191--202 (2014; Zbl 1280.05040) 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 PDFBibTeX XMLCite \textit{L. Esperet} et al., J. Graph Theory 73, No. 1--2, 85--102 (2013; Zbl 1264.05049) 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 PDFBibTeX XMLCite \textit{O. V. Borodin} and \textit{A. O. Ivanova}, J. Graph Theory 67, No. 2, 83--90 (2011; Zbl 1218.05038) 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 PDFBibTeX XMLCite \textit{O. V. Borodin} et al., J. Graph Theory 65, No. 2, 83--93 (2010; Zbl 1209.05177) Full Text: DOI