DP-coloring on planar graphs without given adjacent short cycles-Reference-Cited by-同舟云学术

DP-coloring on planar graphs without given adjacent short cycles

Published:2020-10-10 Issue:02 Volume:13 Page:2150013
ISSN:1793-8309
Container-title:Discrete Mathematics, Algorithms and Applications
language:en
Short-container-title:Discrete Math. Algorithm. Appl.

Author:

Huang Danjun¹,Qi Jingran¹^ORCID

Affiliation:

1. Department of Mathematics, Zhejiang Normal University, Jinhua 321004, China

Abstract

DP-coloring (also known as correspondence coloring) introduced by Dvor̆ák and Postle (2015) is a generalization of list coloring. In 2019, Chen et al. showed that planar graphs without [Formula: see text]-cycles adjacent to [Formula: see text]-cycles are DP-[Formula: see text]-colorable for [Formula: see text] and [Formula: see text]. In this paper, we will prove that planar graphs without [Formula: see text]-cycles adjacent simultaneously to [Formula: see text]-cycles and [Formula: see text]-cycles are DP-[Formula: see text]-colorable, which is an extension of the above result.

Funder

Natural Science Foundation of Zhejiang Province

Publisher

World Scientific Pub Co Pte Lt

Subject

Discrete Mathematics and Combinatorics

Link

https://www.worldscientific.com/doi/pdf/10.1142/S1793830921500130

Reference17 articles.

1. DP-4-colorability of two classes of planar graphs

2. Correspondence coloring and its application to list-coloring planar graphs without cycles of lengths 4 to 8

3. Planar Graphs without 7-Cycles Are 4-Choosable

Cited by 1 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Relaxed DP-3-Coloring of Planar Graphs Without Some Cycles;Bulletin of the Malaysian Mathematical Sciences Society;2022-05-14