DP-coloring for planar graphs of diameter two
From MaRDI portal
Abstract: DP-coloring (also known as correspondence coloring) is a generalization of list coloring introduced by Dvou{r}'{a}k and Postle (2017). Recently, Huang et al. [1] showed that planar graphs with diameter at most two are -choosable. In this paper, we will prove that planar graphs with diameter at most two are DP--colorable, which is an extension of the above result.
This page was built for publication: DP-coloring for planar graphs of diameter two
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6327723)
