DP-3-coloring of some planar graphs
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.
- Publication:
-
arXiv e-prints
- Pub Date:
- February 2018
- DOI:
- 10.48550/arXiv.1802.09312
- arXiv:
- arXiv:1802.09312
- Bibcode:
- 2018arXiv180209312L
- Keywords:
-
- Mathematics - Combinatorics
- E-Print:
- 15 pages, five figures. We revised the previous version based on referees' report