4 citations · 12 across the 10 of their papers we have counts for
Showing 2018Show all
2 papers · 1 filter
math.CO2018
DP-3-coloring of planar graphs without -cycles and two cycles from
Runrun Liu, Sarah Loeb, Martin Rolek +2
A generalization of list-coloring, now known as DP-coloring, was recently introduced by Dvořák and Postle. Essentially, DP-coloring assigns an arbitrary matching between lists of c…
math.CO2018★ 4 cited
DP-3-coloring of some planar graphs
Runrun Liu, Sarah Loeb, Yuxue Yin +1
In this article, we use a unified approach to prove several classes of planar graphs are DP--colorable, which extend the corresponding results on -choosability.