Ich stimme zu, dass diese Seite Cookies verwende. Weitere Informationen finden Sie unter unseren Datenschutzerklärungen .
X
Liu, Runrun
44  Ergebnisse:
OpenAccess-Volltexte X
?
1

1-planar graphs are odd 13-colorable:

Liu, Runrun ; Wang, Weifan ; Yu, Gexin
http://arxiv.org/abs/2206.13967.  , 2022
Link: http://arxiv.org/abs/220..
 
?
2

Spanning tree packing and 2-essential edge-connectivity:

Gu, Xiaofeng ; Liu, Runrun ; Yu, Gexin
http://arxiv.org/abs/2208.12922.  , 2022
Link: http://arxiv.org/abs/220..
 
?
3

Planar graphs without short even cycles are near-bipartite:

Liu, Runrun ; Yu, Gexin
http://arxiv.org/abs/2106.00159.  , 2021
Link: http://arxiv.org/abs/210..
 
?
4

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

Liu, Runrun ; Liu, Xujun ; Rolek, Martin.
http://arxiv.org/abs/1911.03824.  , 2019
Link: http://arxiv.org/abs/191..
 
?
5

Planar graphs without 7-cycles and butterflies are DP-4-col..:

Kim, Seog-Jin ; Liu, Runrun ; Yu, Gexin
http://arxiv.org/abs/1907.06789.  , 2019
Link: http://arxiv.org/abs/190..
 
?
6

Fat-triangle linkage and kite-linked graphs:

Liu, Runrun ; Rolek, Martin ; Yu, Gexin
http://arxiv.org/abs/1906.09197.  , 2019
Link: http://arxiv.org/abs/190..
 
?
7

DP-3-coloring of planar graphs without $4,9$-cycles and two..:

Liu, Runrun ; Loeb, Sarah ; Rolek, Martin..
http://arxiv.org/abs/1809.07445.  , 2018
Link: http://arxiv.org/abs/180..
 
?
8

DP-4-colorability of two classes of planar graphs:

Chen, Lily ; Liu, Runrun ; Yu, Gexin..
http://arxiv.org/abs/1811.02920.  , 2018
Link: http://arxiv.org/abs/181..
 
?
9

Planar graphs without 4-cycles and close triangles are (2,0..:

Hoskins, Heather ; Liu, Runrun ; Vandenbussche, Jennifer.
http://arxiv.org/abs/1806.07511.  , 2018
Link: http://arxiv.org/abs/180..
 
?
10

Every planar graph without 4-cycles adjacent to two triangl..:

Liu, Runrun ; Li, Xiangwen
http://arxiv.org/abs/1804.09031.  , 2018
Link: http://arxiv.org/abs/180..
 
?
11

DP-3-coloring of some planar graphs:

Liu, Runrun ; Loeb, Sarah ; Yin, Yuxue.
http://arxiv.org/abs/1802.09312.  , 2018
Link: http://arxiv.org/abs/180..
 
?
12

Every planar graph without adjacent cycles of length at mos..:

Liu, Runrun ; Li, Xiangwen
http://arxiv.org/abs/1804.03976.  , 2018
Link: http://arxiv.org/abs/180..
 
?
13

Minimum degree condition for a graph to be knitted:

Liu, Runrun ; Rolek, Martin ; Yu, Gexin
http://arxiv.org/abs/1811.07482.  , 2018
Link: http://arxiv.org/abs/181..
 
?
14

A relaxation of the Bordeaux Conjecture:

Liu, Runrun ; Li, Xiangwen ; Yu, Gexin
http://arxiv.org/abs/1407.5138.  , 2014
Link: http://arxiv.org/abs/140..
 
?
15

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

Liu, Runrun ; Li, Xiangwen ; Yu, Gexin
http://arxiv.org/abs/1409.4054.  , 2014
Link: http://arxiv.org/abs/140..
 
1-15