Runrun Liu - RankMe

23 papers Journal 22Unranked 1

Year	Rank	Type	Title / Venue / Authors
2025	—	`conf`	Fire Detection System Based On YOLOv5. BigDataSecurity Zetong Huang, Fengling Wu, Wei Jin, JiaXing Luo, QiKun Shi, Runrun Liu
2025	J	`jnl`	Proper conflict-free 6-coloring of planar graphs without short cycles. Appl. Math. Comput. Yunlong Wang, Weifan Wang, Runrun Liu
2023	J	`jnl`	1-planar graphs are odd 13-colorable. Discret. Math. Runrun Liu, Weifan Wang, Gexin Yu
2023	J	`jnl`	IC-planar graphs are odd-10-colorable. Appl. Math. Comput. Chenran Pan, Weifan Wang, Runrun Liu
2023	J	`jnl`	Optimal connectivity for fat-triangle linkages. Discret. Math. Runrun Liu, Martin Rolek, Gexin Yu
2023	J	`jnl`	Spanning tree packing and 2-essential edge-connectivity. Discret. Math. Xiaofeng Gu, Runrun Liu, Gexin Yu
2022	J	`jnl`	A sufficient condition for a planar graph to be (F, F2)-partitionable. Discret. Appl. Math. Runrun Liu, Weifan Wang
2021	J	`jnl`	Connectivity for Kite-Linked Graphs. SIAM J. Discret. Math. Runrun Liu, Martin Rolek, D. Christopher Stephens, Dong Ye, Gexin Yu
2021	J	`jnl`	Planar graphs without 4-cycles and intersecting triangles are (1, 1, 0)-colorable. Discret. Appl. Math. Xiangwen Li, Runrun Liu, Gexin Yu
2020	J	`jnl`	DP-4-colorability of planar graphs without adjacent cycles of given length. Discret. Appl. Math. Runrun Liu, Xiangwen Li, Kittikorn Nakprasit, Pongpat Sittitrai, Gexin Yu
2020	J	`jnl`	Packing (1, 1, 2, 2)-coloring of some subcubic graphs. Discret. Appl. Math. Runrun Liu, Xujun Liu, Martin Rolek, Gexin Yu
2020	J	`jnl`	Planar graphs without 7-cycles and butterflies are DP-4-colorable. Discret. Math. Seog-Jin Kim, Runrun Liu, Gexin Yu
2020	J	`jnl`	Planar graphs without short even cycles are near-bipartite. Discret. Appl. Math. Runrun Liu, Gexin Yu
2019	J	`jnl`	DP-3-Coloring of Planar Graphs Without 4, 9-Cycles and Cycles of Two Lengths from {6, 7, 8}. Graphs Comb. Runrun Liu, Sarah Loeb, Martin Rolek, Yuxue Yin, Gexin Yu
2019	J	`jnl`	DP-3-coloring of some planar graphs. Discret. Math. Runrun Liu, Sarah Loeb, Yuxue Yin, Gexin Yu
2019	J	`jnl`	DP-4-colorability of two classes of planar graphs. Discret. Math. Lily Chen, Runrun Liu, Gexin Yu, Ren Zhao, Xiangqian Zhou
2019	J	`jnl`	Decomposing a planar graph without triangular 4-cycles into a matching and a 3-colorable graph. Discret. Appl. Math. Ziwen Huang, Runrun Liu, Gaozhen Wang
2019	J	`jnl`	Every planar graph without 4-cycles adjacent to two triangles is DP-4-colorable. Discret. Math. Runrun Liu, Xiangwen Li
2019	J	`jnl`	Every planar graph without adjacent cycles of length at most 8 is 3-choosable. Eur. J. Comb. Runrun Liu, Xiangwen Li
2019	J	`jnl`	Minimum degree condition for a graph to be knitted. Discret. Math. Runrun Liu, Martin Rolek, Gexin Yu
2018	J	`jnl`	Planar graphs without 4-cycles and close triangles are (2, 0, 0)-colorable. J. Comb. Optim. Heather Hoskins, Runrun Liu, Jennifer Vandenbussche, Gexin Yu
2016	J	`jnl`	Planar graphs without 5-cycles and intersecting triangles are (1, 1, 0)-colorable. Discret. Math. Runrun Liu, Xiangwen Li, Gexin Yu
2015	J	`jnl`	A relaxation of the Bordeaux Conjecture. Eur. J. Comb. Runrun Liu, Xiangwen Li, Gexin Yu