Every Planar Graph with the Distance of 5 ? -Cycles at Least 3 from Each Other Is 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. 8, issue 11, 1-13

Abstract: DP-coloring was introduced by Dvo?ák and Postle [J. Comb. Theory Ser. B 2018, 129, 38–54]. In this paper, we prove that every planar graph in which the 5 − -cycles are at distance of at least 3 from each other is DP-3-colorable, which improves the result of Montassier et al. [Inform. Process. Lett. 2008, 107, 3–4] and Yin and Yu [Discret. Math. 2019, 342, 2333–2341].

Keywords: DP-coloring; planar graphs (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/8/11/1920/pdf (application/pdf)
https://www.mdpi.com/2227-7390/8/11/1920/ (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:8:y:2020:i:11:p:1920-:d:438717

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 ().