A relaxation of the Bordeaux Conjecture. - Runrun Liu; Xiangwen Li; Gexin Yu (Eur. J. Comb., 2015)

Planar graphs without 5-cycles and intersecting triangles are (1, 1, 0)-colorable. - Runrun Liu; Xiangwen Li; Gexin Yu (Discret. Math., 2016)

Planar graphs without 4-cycles and close triangles are (2, 0, 0)-colorable. - Heather Hoskins; Runrun Liu; Jennifer Vandenbussche; Gexin Yu (J. Comb. Optim., 2018)

Decomposing a planar graph without triangular 4-cycles into a matching and a 3-colorable graph. - Ziwen Huang; Runrun Liu; Gaozhen Wang (Discret. Appl. Math., 2019)

DP-4-colorability of two classes of planar graphs. - Lily Chen; Runrun Liu; Gexin Yu; Ren Zhao; Xiangqian Zhou (Discret. Math., 2019)

Every planar graph without 4-cycles adjacent to two triangles is DP-4-colorable. - Runrun Liu; Xiangwen Li (Discret. Math., 2019)

DP-3-coloring of some planar graphs. - Runrun Liu; Sarah Loeb; Yuxue Yin; Gexin Yu (Discret. Math., 2019)

Minimum degree condition for a graph to be knitted. - Runrun Liu; Martin Rolek; Gexin Yu (Discret. Math., 2019)

Every planar graph without adjacent cycles of length at most 8 is 3-choosable. - Runrun Liu; Xiangwen Li (Eur. J. Comb., 2019)

DP-3-Coloring of Planar Graphs Without 4, 9-Cycles and Cycles of Two Lengths from {6, 7, 8}. - Runrun Liu; Sarah Loeb; Martin Rolek; Yuxue Yin; Gexin Yu (Graphs Comb., 2019)

DP-4-colorability of planar graphs without adjacent cycles of given length. - Runrun Liu; Xiangwen Li; Kittikorn Nakprasit; Pongpat Sittitrai; Gexin Yu (Discret. Appl. Math., 2020)

Packing (1, 1, 2, 2)-coloring of some subcubic graphs. - Runrun Liu; Xujun Liu; Martin Rolek; Gexin Yu (Discret. Appl. Math., 2020)

Planar graphs without short even cycles are near-bipartite. - Runrun Liu; Gexin Yu (Discret. Appl. Math., 2020)

Planar graphs without 7-cycles and butterflies are DP-4-colorable. - Seog-Jin Kim; Runrun Liu; Gexin Yu (Discret. Math., 2020)

Planar graphs without 4-cycles and intersecting triangles are (1, 1, 0)-colorable. - Xiangwen Li; Runrun Liu; Gexin Yu (Discret. Appl. Math., 2021)

Connectivity for Kite-Linked Graphs. - Runrun Liu; Martin Rolek; D. Christopher Stephens; Dong Ye 002; Gexin Yu (SIAM J. Discret. Math., 2021)

A sufficient condition for a planar graph to be (F, F2)-partitionable. - Runrun Liu; Weifan Wang 001 (Discret. Appl. Math., 2022)

Spanning tree packing and 2-essential edge-connectivity. - Xiaofeng Gu 002; Runrun Liu; Gexin Yu (Discret. Math., 2023)

Optimal connectivity for fat-triangle linkages. - Runrun Liu; Martin Rolek; Gexin Yu (Discret. Math., 2023)

IC-planar graphs are odd-10-colorable. - Chenran Pan; Weifan Wang 001; Runrun Liu (Appl. Math. Comput., 2023)

1-planar graphs are odd 13-colorable. - Runrun Liu; Weifan Wang 001; Gexin Yu (Discret. Math., 2023)

Fire Detection System Based On YOLOv5. - Zetong Huang; Fengling Wu; Wei Jin; Jiaxing Luo; QiKun Shi; Runrun Liu (BigDataSecurity, 2025)

Proper conflict-free 6-coloring of planar graphs without short cycles. - Yunlong Wang; Weifan Wang 001; Runrun Liu (Appl. Math. Comput., 2025)