Runrun Liu

most citedPlanar graphs without 5-cycles and intersecting triangles are

(1, 1, 0)

-colorable

1 citations · 3 across the 3 of their papers we have counts for

collaborators

3 papers

math.CO2019★ 1 cited

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

Runrun Liu, Xujun Liu, Martin Rolek +1

For a sequence of non-decreasing positive integers $S = (s_{1}, \dots, s_{k})$ , a packing $S$ -coloring is a partition of $V (G)$ into sets $V_{1}, \dots, V_{k}$ such that for each $1\leq…

math.CO2014★ 1 cited

Planar graphs without 5-cycles and intersecting triangles are $(1, 1, 0)$ -colorable

Runrun Liu, Xiangwen Li, Gexin Yu

A $(c_{1}, c_{2}, ..., c_{k})$ -coloring of $G$ is a mapping $φ : V (G) \mapsto {1, 2, ..., k}$ such that for every $i, 1 \leq i \leq k$ , $G [V_{i}]$ has maximum degree at most $c_{i}$ , where $G [V_{i}]$ d…

math.CO2014★ 1 cited

A relaxation of the Bordeaux Conjecture

Runrun Liu, Xiangwen Li, Gexin Yu

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

Planar graphs without 5-cycles and intersecting triangles are (1,1,0)-colorable

A relaxation of the Bordeaux Conjecture

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

Planar graphs without 5-cycles and intersecting triangles are $(1, 1, 0)$ -colorable