English

DP-3-colorability of planar graphs without cycles of length 4, 7 or 9

Combinatorics 2023-03-09 v1
Authors: Yingli Kang , Ligang Jin , Xuding Zhu
View on arXiv ↗ PDF ↗

Abstract

This paper proves that every planar graph without cycles of length 4, 7, or 9 is DP-3-colorable.

Keywords

planar graphs dp-3-colorability cycle length graph coloring

Cite

@article{arxiv.2303.04657,
  title  = {DP-3-colorability of planar graphs without cycles of length 4, 7 or 9},
  author = {Yingli Kang and Ligang Jin and Xuding Zhu},
  journal= {arXiv preprint arXiv:2303.04657},
  year   = {2023}
}

Comments

12 pages, 2 figures

Related papers

View all related →
Combinatorics · Mathematics
The 3-colorability of planar graphs without cycles of length 4, 6 and 9
Yingli Kang, Ligang Jin, Yingqian Wang
2017-02-27
Combinatorics · Mathematics
Planar graphs having no cycle of length $4$, $6$ or $8$ are DP-3-colorable
Ligang Jin, Yingli Kang, Xuding Zhu
2024-12-30
Combinatorics · Mathematics
DP-3-coloring of planar graphs without $4,9$-cycles and two cycles from $\{5,6,7,8\}$
Runrun Liu, Sarah Loeb, Martin Rolek, Yuxue Yin +1
2018-09-21
Combinatorics · Mathematics
(1,0,0)-colorability of planar graphs without cycles of length 4 or 6
Ligang Jin, Yingli Kang, Peipei Liu, Yingqian Wang
2020-01-03
Combinatorics · Mathematics
Every planar graph without adjacent cycles of length at most $8$ is $3$-choosable
Runrun Liu, Xiangwen Li
2019-07-17
Combinatorics · Mathematics
Planar graphs without cycles of length 4 or 5 are $(7m:2m)$-DP-colorable
Xiaoyan Xu, Xuding Zhu
2025-11-18
Combinatorics · Mathematics
Planar graphs without cycles of length 4 or 5 are (11:3)-colorable
Zdeněk Dvořák, Xiaolan Hu
2019-07-16
Combinatorics · Mathematics
Every signed planar graph without cycles of length from 4 to 7 is 3-colorable
Lan Kaiyang, Liu Feng
2022-05-04
Combinatorics · Mathematics
Relaxed DP-3-coloring of planar graphs without some cycles
Huihui Fang, Tao Wang
2023-11-07
Combinatorics · Mathematics
Planar graphs without cycles of lengths 4 and 5 and close triangles are DP-3-colorable
Yuxue Yin, Gexin Yu
2018-09-05
Combinatorics · Mathematics
DP-3-coloring of planar graphs without certain cycles
Mengjiao Rao, Tao Wang
2022-06-13
Combinatorics · Mathematics
Sufficient conditions on planar graphs to have a relaxed DP-$3$-colorability
Pongpat Sittitrai, Kittikorn Nakprasit
2018-03-12
Combinatorics · Mathematics
Every planar graph without $i$-cycles adjacent simultaneously to $j$-cycles and $k$-cycles is DP-$4$-colorable when $\{i,j,k\}=\{3,4,5\}$
Pongpat Sittitrai, Kittikorn Nakprasit
2018-02-01
Combinatorics · Mathematics
Generalization of some results on list coloring and DP-coloring
Keaitsuda Maneeruk Nakprasit, Kittikorn Nakprasit
2019-08-12
Combinatorics · Mathematics
Planar graphs without normally adjacent short cycles
Fangyao Lu, Mengjiao Rao, Qianqian Wang, Tao Wang
2022-06-13
Combinatorics · Mathematics
Planar graphs without 4-cycles adjacent to triangles are DP-4-colorable
Seog-Jin Kim, Xiaowei Yu
2017-12-27
Combinatorics · Mathematics
A comment to: On 3-colorable planar graphs without short cycles
S. Akbari, Behrooz Bagheri Gh
2008-10-21
Combinatorics · Mathematics
A Sufficient condition for DP-4-colorability
Seog-Jin Kim, Kenta Ozeki
2017-09-29
Combinatorics · Mathematics
Planar graphs without 7-cycles and butterflies are DP-4-colorable
Seog-Jin Kim, Runrun Liu, Gexin Yu
2019-11-05
Combinatorics · Mathematics
DP-4-coloring of planar graphs with some restrictions on cycles
Rui Li, Tao Wang
2022-06-13
Combinatorics · Mathematics
Multiple DP-coloring of planar graphs without 3-cycles and normally adjacent 4-cycles
Huan Zhou, Xuding Zhu
2022-01-31
Combinatorics · Mathematics
Every planar graph without adjacent short cycles is 3-colorable
Tao Wang
2010-04-06
Combinatorics · Mathematics
DP-4-colorability of two classes of planar graphs
Lily Chen, Runrun Liu, Gexin Yu, Ren Zhao +1
2018-11-08
Combinatorics · Mathematics
Every planar graph without 4-cycles adjacent to two triangles is DP-4-colorable
Runrun Liu, Xiangwen Li
2018-04-25
Combinatorics · Mathematics
Plane graphs without 4- and 5-cycles and without ext-triangular 7-cycles are 3-colorable
Ligang Jin, Yingli Kang, Michael Schubert, Yingqian Wang
2017-02-27