Li, Xiangwen; Liu, Jie; Lv, Jian-Bo Every planar graph without 4-cycles and 5-cycles is (3,3)-colorable. (English) Zbl 1527.05071 Graphs Comb. 39, No. 6, Paper No. 118, 19 p. (2023). MSC: 05C15 05C10 05C38 PDFBibTeX XMLCite \textit{X. Li} et al., Graphs Comb. 39, No. 6, Paper No. 118, 19 p. (2023; Zbl 1527.05071) Full Text: DOI
Li, Xiangwen; Liu, Jie; Lv, Jian-Bo Every planar graph with girth at least 5 is \((1,9)\)-colorable. (English) Zbl 1486.05096 Discrete Math. 345, No. 6, Article ID 112818, 14 p. (2022). MSC: 05C15 05C10 PDFBibTeX XMLCite \textit{X. Li} et al., Discrete Math. 345, No. 6, Article ID 112818, 14 p. (2022; Zbl 1486.05096) Full Text: DOI
Li, Xiangwen; Liu, Runrun; Yu, Gexin Planar graphs without 4-cycles and intersecting triangles are \(( 1 , 1 , 0 )\)-colorable. (English) Zbl 1480.05057 Discrete Appl. Math. 304, 236-247 (2021). Reviewer: Guillermo Pineda Villavicencio MSC: 05C15 05C10 05C38 PDFBibTeX XMLCite \textit{X. Li} et al., Discrete Appl. Math. 304, 236--247 (2021; Zbl 1480.05057) Full Text: DOI arXiv
Li, Xiangwen; Shen, Qin; Tian, Fanyu Planar graphs without adjacent cycles of length at most five are (2, 0, 0)-colorable. (English) Zbl 1462.05115 Bull. Malays. Math. Sci. Soc. (2) 44, No. 3, 1167-1194 (2021). Reviewer: Eckhard Steffen (Paderborn) MSC: 05C10 05C15 05C38 05C12 PDFBibTeX XMLCite \textit{X. Li} et al., Bull. Malays. Math. Sci. Soc. (2) 44, No. 3, 1167--1194 (2021; Zbl 1462.05115) Full Text: DOI
Li, Xiangwen; Yin, Yuxue; Yu, Gexin Every planar graph without 5-cycles and \(K_4^-\) and adjacent 4-cycles is \((2, 0, 0)\)-colorable. (English) Zbl 1429.05073 Discrete Math. 343, No. 2, Article ID 111661, 12 p. (2020). MSC: 05C15 05C10 05C38 PDFBibTeX XMLCite \textit{X. Li} et al., Discrete Math. 343, No. 2, Article ID 111661, 12 p. (2020; Zbl 1429.05073) Full Text: DOI