English

DP-3-coloring of some planar graphs

Combinatorics 2018-09-20 v4

Abstract

In this article, we use a unified approach to prove several classes of planar graphs are DP-33-colorable, which extend the corresponding results on 33-choosability.

Keywords

Cite

@article{arxiv.1802.09312,
  title  = {DP-3-coloring of some planar graphs},
  author = {Runrun Liu and Sarah Loeb and Yuxue Yin and Gexin Yu},
  journal= {arXiv preprint arXiv:1802.09312},
  year   = {2018}
}

Comments

15 pages, five figures. We revised the previous version based on referees' report

R2 v1 2026-06-23T00:33:29.604Z