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
Chang, Gerard Jennhwa; Hou, Jianfeng; Roussel, Nicolas On the total choosability of planar graphs and of sparse graphs. (English) Zbl 1234.05081 Inf. Process. Lett. 110, No. 20, 849-853 (2010). MSC: 05C15 05C10 PDF BibTeX XML Cite \textit{G. J. Chang} et al., Inf. Process. Lett. 110, No. 20, 849--853 (2010; Zbl 1234.05081) Full Text: DOI
Borodin, O. V.; Ivanova, A. O. Near-proper vertex 2-colorings of sparse graphs. (Russian) Zbl 1249.05110 Diskretn. Anal. Issled. Oper. 16, No. 2, 16-20 (2009). MSC: 05C15 05C10 05C07 PDF BibTeX XML Cite \textit{O. V. Borodin} and \textit{A. O. Ivanova}, Diskretn. Anal. Issled. Oper. 16, No. 2, 16--20 (2009; Zbl 1249.05110)
Hosseini Dolama, Mohammad; Sopena, Eric On the maximum average degree and the incidence chromatic number of a graph. (English) Zbl 1153.05318 Discrete Math. Theor. Comput. Sci. 7, No. 1, 203-216 (2005). MSC: 05C15 PDF BibTeX XML Cite \textit{M. Hosseini Dolama} and \textit{E. Sopena}, Discrete Math. Theor. Comput. Sci. 7, No. 1, 203--216 (2005; Zbl 1153.05318) Full Text: Link EuDML