DP-3-coloring of planar graphs without 4,9-cycles and two cycles from \{5,6,7,8\}
From MaRDI portal
Publication:6306997
Abstract: A generalization of list-coloring, now known as DP-coloring, was recently introduced by Dvov{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 extended to the setting of DP-coloring. We note that list-coloring results do not always extend to DP-coloring results. Our main result in this paper is to prove that every planar graph without cycles of length for is DP--colorable, extending three existing results on -choosability of planar graphs.
This page was built for publication: DP-3-coloring of planar graphs without $4,9$-cycles and two cycles from $\{5,6,7,8\}$
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6306997)
