4 citations · 11 across the 18 of their papers we have counts for
19 papers
Flexible DP-4-coloring of planar graphs without 4-cycles and intersecting triangles
Shu Fang, Runrun Liu, Gexin Yu
Graph coloring with preferences offers a powerful framework for constraint satisfaction problems in which fulfilling every request is impossible but satisfying a guaranteed positiv…
List-recoloring of two classes of planar graphs
Chenran Pan, Weifan Wang, Runrun Liu
For a graph with a list assignment and two -colorings and , an -recoloring sequence from to is a sequence of proper -colorings where consecutive col…
Connectivity of contraction-critical graphs
Michael Lafferty, Runrun Liu, Martin Rolek +1
Contraction-critical graphs came from the study of minimal counterexamples to Hadwiger's conjecture. A graph is -contraction-critical if it is -chromatic, but any proper mino…
Spanning tree packing and 2-essential edge-connectivity
Xiaofeng Gu, Runrun Liu, Gexin Yu
An edge (vertex) cut of is -essential if has two components each of which has at least edges. A graph is -essentially -edge-connected (resp. -conn…
1-planar graphs are odd 13-colorable
Runrun Liu, Weifan Wang, Gexin Yu
An odd coloring of a graph is a proper coloring such that any non-isolated vertex in has a coloring appears odd times on its neighbors. The odd chromatic number, denoted by…
Planar graphs without short even cycles are near-bipartite
Runrun Liu, Gexin Yu
A graph is {\em near-bipartite} if its vertex set can be partitioned into an independent set and a set that induces a forest. It is clear that near-bipartite graphs are -colorab…