Liu, Runrun
110  Ergebnisse:
Personensuche X
?
1

Optimal connectivity for fat-triangle linkages:

Liu, Runrun ; Rolek, Martin ; Yu, Gexin
Discrete Mathematics.  346 (2023)  5 - p. 113319 , 2023
 
?
 
?
3

1-planar graphs are odd 13-colorable:

Liu, Runrun ; Wang, Weifan ; Yu, Gexin
Discrete Mathematics.  346 (2023)  8 - p. 113423 , 2023
 
?
4

IC-planar graphs are odd-10-colorable:

Pan, Chenran ; Wang, Weifan ; Liu, Runrun
Applied Mathematics and Computation.  451 (2023)  - p. 128020 , 2023
 
?
 
?
6

A sufficient condition for a planar graph to be (F,F2)-part..:

Liu, Runrun ; Wang, Weifan
Discrete Applied Mathematics.  318 (2022)  - p. 61-68 , 2022
 
?
7

Connectivity for Kite-Linked Graphs:

Liu, Runrun ; Rolek, Martin ; Stephens, D. Christopher..
SIAM Journal on Discrete Mathematics.  35 (2021)  1 - p. 431-446 , 2021
 
?
8

Planar graphs without 4-cycles and intersecting triangles a..:

Li, Xiangwen ; Liu, Runrun ; Yu, Gexin
Discrete Applied Mathematics.  304 (2021)  - p. 236-247 , 2021
 
?
10

Packing (1,1,2,2)-coloring of some subcubic graphs:

Liu, Runrun ; Liu, Xujun ; Rolek, Martin.
Discrete Applied Mathematics.  283 (2020)  - p. 626-630 , 2020
 
?
 
?
12

Planar graphs without short even cycles are near-bipartite:

Liu, Runrun ; Yu, Gexin
Discrete Applied Mathematics.  284 (2020)  - p. 626-630 , 2020
 
?
 
?
 
?
15

Minimum degree condition for a graph to be knitted:

Liu, Runrun ; Rolek, Martin ; Yu, Gexin
Discrete Mathematics.  342 (2019)  11 - p. 3225-3228 , 2019
 
1-15