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

Zhao, Yueying and Miao, Lianying (2020) Planar Graphs with the Distance of 6--Cycles at Least 2 from Each Other Are DP-3-Colorable. Mathematics, 9 (1). p. 70. ISSN 2227-7390

[thumbnail of mathematics-09-00070-v2.pdf]

Text
mathematics-09-00070-v2.pdf - Published Version
Download (346kB)

Official URL: https://doi.org/10.3390/math9010070

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].

Item Type:	Article
Uncontrolled Keywords:	planar graphs; DP-coloring; discharging method
Subjects:	STM Repository > Mathematical Science
Depositing User:	Managing Editor
Date Deposited:	15 Oct 2024 11:47
Last Modified:	15 Oct 2024 11:47
URI:	http://classical.goforpromo.com/id/eprint/878

Actions (login required)

: View Item