Jing, Yubo; Wang, Yingqian (3, 1)-choosability of toroidal graphs with some forbidden short cycles. (English) Zbl 1311.05091 Discrete Appl. Math. 184, 243-247 (2015). MSC: 05C38 05C10 PDFBibTeX XMLCite \textit{Y. Jing} and \textit{Y. Wang}, Discrete Appl. Math. 184, 243--247 (2015; Zbl 1311.05091) Full Text: DOI
Wang, Yingqian; Xu, Jinghan Decomposing a planar graph without cycles of length 5 into a matching and a 3-colorable graph. (English) Zbl 1301.05273 Eur. J. Comb. 43, 98-123 (2015). MSC: 05C70 05C15 05C10 05C38 PDFBibTeX XMLCite \textit{Y. Wang} and \textit{J. Xu}, Eur. J. Comb. 43, 98--123 (2015; Zbl 1301.05273) Full Text: DOI
Xu, Lingji; Miao, Zhengke; Wang, Yingqian Every planar graph with cycles of length neither 4 nor 5 is \((1,1,0)\)-colorable. (English) Zbl 1309.05058 J. Comb. Optim. 28, No. 4, 774-786 (2014). MSC: 05C10 05C38 05C15 PDFBibTeX XMLCite \textit{L. Xu} et al., J. Comb. Optim. 28, No. 4, 774--786 (2014; Zbl 1309.05058) Full Text: DOI
Wang, Yingqian; Xu, Jinghan Improper colorability of planar graphs without prescribed short cycles. (English) Zbl 1283.05114 Discrete Math. 322, 5-14 (2014). MSC: 05C15 05C10 05C38 PDFBibTeX XMLCite \textit{Y. Wang} and \textit{J. Xu}, Discrete Math. 322, 5--14 (2014; Zbl 1283.05114) Full Text: DOI
Wang, Yingqian; Xu, Jinghan Planar graphs with cycles of length neither 4 nor 6 are \((2,0,0)\)-colorable. (English) Zbl 1285.05071 Inf. Process. Lett. 113, No. 18, 659-663 (2013). MSC: 05C15 05C10 05C38 PDFBibTeX XMLCite \textit{Y. Wang} and \textit{J. Xu}, Inf. Process. Lett. 113, No. 18, 659--663 (2013; Zbl 1285.05071) Full Text: DOI
Hill, Owen; Smith, Diana; Wang, Yingqian; Xu, Lingji; Yu, Gexin Planar graphs without cycles of length 4 or 5 are (3,0,0)-colorable. (English) Zbl 1281.05055 Discrete Math. 313, No. 20, 2312-2317 (2013). MSC: 05C10 05C15 PDFBibTeX XMLCite \textit{O. Hill} et al., Discrete Math. 313, No. 20, 2312--2317 (2013; Zbl 1281.05055) Full Text: DOI