Sign in

DP-3-coloring of planar graphs without 4,9-cycles and two cycles from \{5,6,7,8\}

By Runrun Liu and others
A generalization of list-coloring, now known as DP-coloring, was recently introduced by Dvo\v{r}\'{a}k and Postle. Essentially, DP-coloring assigns an arbitrary matching between lists of colors at adjacent vertices, as opposed to only matching identical colors as is done for list-coloring. Several results on list-coloring of planar graphs have since been... Show more
September 20, 2018
=
0
Loading PDF…
Loading full text...
Similar articles
Loading recommendations...
=
0
x1
DP-3-coloring of planar graphs without $4,9$-cycles and two cycles from $\{5,6,7,8\}$
Click on play to start listening