Liu, Runrun; Yu, Gexin Planar graphs without short even cycles are near-bipartite. (English) Zbl 1443.05047 Discrete Appl. Math. 284, 626-630 (2020). MSC: 05C10 05C12 05C38 05C15 05C70 PDFBibTeX XMLCite \textit{R. Liu} and \textit{G. Yu}, Discrete Appl. Math. 284, 626--630 (2020; Zbl 1443.05047) Full Text: DOI arXiv
Liu, Runrun; Li, Xiangwen; Yu, Gexin Planar graphs without 5-cycles and intersecting triangles are \((1, 1, 0)\)-colorable. (English) Zbl 1327.05117 Discrete Math. 339, No. 2, 992-1003 (2016). MSC: 05C15 05C10 PDFBibTeX XMLCite \textit{R. Liu} et al., Discrete Math. 339, No. 2, 992--1003 (2016; Zbl 1327.05117) Full Text: DOI arXiv
Liu, Runrun; Li, Xiangwen; Yu, Gexin A relaxation of the Bordeaux conjecture. (English) Zbl 1315.05059 Eur. J. Comb. 49, 240-249 (2015). MSC: 05C15 05C10 PDFBibTeX XMLCite \textit{R. Liu} et al., Eur. J. Comb. 49, 240--249 (2015; Zbl 1315.05059) Full Text: DOI arXiv
Cranston, Daniel W.; Kim, Seog-Jin; Yu, Gexin Injective colorings of sparse graphs. (English) Zbl 1209.05075 Discrete Math. 310, No. 21, 2965-2973 (2010). MSC: 05C15 05C10 PDFBibTeX XMLCite \textit{D. W. Cranston} et al., Discrete Math. 310, No. 21, 2965--2973 (2010; Zbl 1209.05075) Full Text: DOI arXiv