Runrun Liu

activity

20142026

most citedDP-3-coloring of some planar graphs

4 citations · 11 across the 18 of their papers we have counts for

collaborators

Showing 2014 · math.COShow all

2 papers · 2 filters

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

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

A relaxation of the Bordeaux Conjecture

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