activity
20132018
most citedZ3-connectivity with independent number 2

2 citations · 7 across the 9 of their papers we have counts for

collaborators
Showing 2018Show all

2 papers · 1 filter

math.CO2018★ 1 cited

Every planar graph without 4-cycles adjacent to two triangles is DP-4-colorable

Runrun Liu, Xiangwen Li

Wang and Lih in 2002 conjectured that every planar graph without adjacent triangles is 4-choosable. In this paper, we prove that every planar graph without any 4-cycle adjacent to…

math.CO2018

Every planar graph without adjacent cycles of length at most is -choosable

Runrun Liu, Xiangwen Li

DP-coloring as a generalization of list coloring was introduced by Dvořák and Postle in 2017, who proved that every planar graph without cycles from 4 to 8 is 3-choosable, which wa…