Runrun Liu

Publication Activity (10 Years)

Years Active: 2015-2023
Publications (10 Years): 20

Top Topics

Approximate Inference

Lognormal Distribution

Top Venues

Discret. Appl. Math.

J. Comb. Optim.

Publications

Runrun Liu, Weifan Wang, Gexin Yu
1-planar graphs are odd 13-colorable. Discret. Math. 346 (8) (2023)
Xiaofeng Gu, Runrun Liu, Gexin Yu
Spanning tree packing and 2-essential edge-connectivity. Discret. Math. 346 (1) (2023)
Runrun Liu, Martin Rolek, Gexin Yu
Optimal connectivity for fat-triangle linkages. Discret. Math. 346 (5) (2023)
Chenran Pan, Weifan Wang, Runrun Liu
IC-planar graphs are odd-10-colorable. Appl. Math. Comput. 451 (2023)
Runrun Liu, Weifan Wang
A sufficient condition for a planar graph to be (F, F2)-partitionable. Discret. Appl. Math. 318 (2022)
Xiangwen Li, Runrun Liu, Gexin Yu
Planar graphs without 4-cycles and intersecting triangles are (1, 1, 0)-colorable. Discret. Appl. Math. 304 (2021)
Runrun Liu, Martin Rolek, D. Christopher Stephens, Dong Ye, Gexin Yu
Connectivity for Kite-Linked Graphs. SIAM J. Discret. Math. 35 (1) (2021)
Runrun Liu, Xujun Liu, Martin Rolek, Gexin Yu
Packing (1, 1, 2, 2)-coloring of some subcubic graphs. Discret. Appl. Math. 283 (2020)
Seog-Jin Kim, Runrun Liu, Gexin Yu
Planar graphs without 7-cycles and butterflies are DP-4-colorable. Discret. Math. 343 (8) (2020)
Runrun Liu, Xiangwen Li, Kittikorn Nakprasit, Pongpat Sittitrai, Gexin Yu
DP-4-colorability of planar graphs without adjacent cycles of given length. Discret. Appl. Math. 277 (2020)
Runrun Liu, Gexin Yu
Planar graphs without short even cycles are near-bipartite. Discret. Appl. Math. 284 (2020)
Runrun Liu, Martin Rolek, Gexin Yu
Minimum degree condition for a graph to be knitted. Discret. Math. 342 (11) (2019)
Runrun Liu, Sarah Loeb, Yuxue Yin, Gexin Yu
DP-3-coloring of some planar graphs. Discret. Math. 342 (1) (2019)
Ziwen Huang, Runrun Liu, Gaozhen Wang
Decomposing a planar graph without triangular 4-cycles into a matching and a 3-colorable graph. Discret. Appl. Math. 268 (2019)
Runrun Liu, Sarah Loeb, Martin Rolek, Yuxue Yin, Gexin Yu
DP-3-Coloring of Planar Graphs Without 4, 9-Cycles and Cycles of Two Lengths from {6, 7, 8}. Graphs Comb. 35 (3) (2019)
Lily Chen, Runrun Liu, Gexin Yu, Ren Zhao, Xiangqian Zhou
DP-4-colorability of two classes of planar graphs. Discret. Math. 342 (11) (2019)
Runrun Liu, Xiangwen Li
Every planar graph without adjacent cycles of length at most 8 is 3-choosable. Eur. J. Comb. 82 (2019)
Runrun Liu, Xiangwen Li
Every planar graph without 4-cycles adjacent to two triangles is DP-4-colorable. Discret. Math. 342 (3) (2019)
Heather Hoskins, Runrun Liu, Jennifer Vandenbussche, Gexin Yu
Planar graphs without 4-cycles and close triangles are (2, 0, 0)-colorable. J. Comb. Optim. 36 (2) (2018)
Runrun Liu, Xiangwen Li, Gexin Yu
Planar graphs without 5-cycles and intersecting triangles are (1, 1, 0)-colorable. Discret. Math. 339 (2) (2016)
Runrun Liu, Xiangwen Li, Gexin Yu
A relaxation of the Bordeaux Conjecture. Eur. J. Comb. 49 (2015)