Planar Graphs with the Distance of 6 - -Cycles at Least 2 from Each Other Are DP-3-Colorable

Yueying Zhao and Lianying Miao
Additional contact information
Yueying Zhao: School of Mathematics, China University of Mining and Technology, Xuzhou 221116, China
Lianying Miao: School of Mathematics, China University of Mining and Technology, Xuzhou 221116, China

Mathematics, 2020, vol. 9, issue 1, 1-10

Abstract: DP-coloring as a generalization of list coloring was introduced by Dvo?ák and Postle recently. In this paper, we prove that every planar graph in which the distance between 6 − -cycles is at least 2 is DP-3-colorable, which extends the result of Yin and Yu [Discret. Math. 2019, 342, 2333–2341].

Keywords: planar graphs; DP-coloring; discharging method (search for similar items in EconPapers)
JEL-codes: C (search for similar items in EconPapers)
Date: 2020
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
https://www.mdpi.com/2227-7390/9/1/70/pdf (application/pdf)
https://www.mdpi.com/2227-7390/9/1/70/ (text/html)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:gam:jmathe:v:9:y:2020:i:1:p:70-:d:472601

Access Statistics for this article

Mathematics is currently edited by Ms. Emma He

More articles in Mathematics from MDPI
Bibliographic data for series maintained by MDPI Indexing Manager ().