Edge DP-coloring in planar graphs

Li Zhang; You Lu; Shenggui Zhang

doi:10.1016/j.disc.2021.112314

Edge DP-coloring in planar graphs

Li Zhang
, You Lu
, Shenggui Zhang

数学与统计学院

Northwestern Polytechnical University Xian

科研成果: 期刊稿件 › 文章 › 同行评审

4 引用（Scopus）

摘要

As a generalization of list coloring, DP-coloring of graphs was introduced by Dvořák and Postle (2018). Recently, Bernshteyn and Kostochka introduced edge DP-coloring of graphs which is naturally corresponding to the DP-coloring of their line graphs. Let χ_DP^′(G) denote the edge DP-chromatic number of a graph G. In this paper, we prove that if G is a planar graph with maximum degree Δ and without cycles of length k, then (1) χ_DP^′(G)=Δ if either Δ≥7 and k=4 or Δ≥8 and k=3; (2) χ_DP^′(G)≤Δ+1 if Δ≥9.

源语言	英语
文章编号	112314
期刊	Discrete Mathematics
卷	344
期	5
DOI	https://doi.org/10.1016/j.disc.2021.112314
出版状态	已出版 - 5月 2021

访问文件

10.1016/j.disc.2021.112314

其它文件与链接

链接到 Scopus 的出版物

引用此

@article{b9bb50868c6840b68a258e93f163fc3c,

title = "Edge DP-coloring in planar graphs",

abstract = "As a generalization of list coloring, DP-coloring of graphs was introduced by Dvo{\v r}{\'a}k and Postle (2018). Recently, Bernshteyn and Kostochka introduced edge DP-coloring of graphs which is naturally corresponding to the DP-coloring of their line graphs. Let χDP′(G) denote the edge DP-chromatic number of a graph G. In this paper, we prove that if G is a planar graph with maximum degree Δ and without cycles of length k, then (1) χDP′(G)=Δ if either Δ≥7 and k=4 or Δ≥8 and k=3; (2) χDP′(G)≤Δ+1 if Δ≥9.",

keywords = "Edge DP-coloring, Edge coloring, Edge list coloring, Planar graph",

author = "Li Zhang and You Lu and Shenggui Zhang",

note = "Publisher Copyright: {\textcopyright} 2021 Elsevier B.V.",

year = "2021",

month = may,

doi = "10.1016/j.disc.2021.112314",

language = "英语",

volume = "344",

journal = "Discrete Mathematics",

issn = "0012-365X",

publisher = "Elsevier B.V.",

number = "5",

}

TY - JOUR

T1 - Edge DP-coloring in planar graphs

AU - Zhang, Li

AU - Lu, You

AU - Zhang, Shenggui

PY - 2021/5

Y1 - 2021/5

N2 - As a generalization of list coloring, DP-coloring of graphs was introduced by Dvořák and Postle (2018). Recently, Bernshteyn and Kostochka introduced edge DP-coloring of graphs which is naturally corresponding to the DP-coloring of their line graphs. Let χDP′(G) denote the edge DP-chromatic number of a graph G. In this paper, we prove that if G is a planar graph with maximum degree Δ and without cycles of length k, then (1) χDP′(G)=Δ if either Δ≥7 and k=4 or Δ≥8 and k=3; (2) χDP′(G)≤Δ+1 if Δ≥9.

AB - As a generalization of list coloring, DP-coloring of graphs was introduced by Dvořák and Postle (2018). Recently, Bernshteyn and Kostochka introduced edge DP-coloring of graphs which is naturally corresponding to the DP-coloring of their line graphs. Let χDP′(G) denote the edge DP-chromatic number of a graph G. In this paper, we prove that if G is a planar graph with maximum degree Δ and without cycles of length k, then (1) χDP′(G)=Δ if either Δ≥7 and k=4 or Δ≥8 and k=3; (2) χDP′(G)≤Δ+1 if Δ≥9.

KW - Edge DP-coloring

KW - Edge coloring

KW - Edge list coloring

KW - Planar graph

UR - https://www.scopus.com/pages/publications/85100061777

U2 - 10.1016/j.disc.2021.112314

DO - 10.1016/j.disc.2021.112314

M3 - 文章

AN - SCOPUS:85100061777

SN - 0012-365X

VL - 344

JO - Discrete Mathematics

JF - Discrete Mathematics

IS - 5

M1 - 112314

ER -

Edge DP-coloring in planar graphs

摘要

访问文件

其它文件与链接

指纹

引用此