Recognition: unknown
DP-3-coloring of some planar graphs
classification
🧮 math.CO
keywords
graphsplanarapproacharticlechoosabilityclassescolorablecorresponding
read the original abstract
In this article, we use a unified approach to prove several classes of planar graphs are DP-$3$-colorable, which extend the corresponding results on $3$-choosability.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.