Cover Image

Planar graphs without cycles of length 4 or 5 are $(7m:2m)$-DP-colorable

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Xu, Xiaoyan, Zhu, Xuding
Format:	Preprint
Published:	2025
Subjects:	Combinatorics
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Planar graphs having no cycle of length $4$, $6$ or $8$ are DP-3-colorable
by: Jin, Ligang, et al.
Published: (2024)

Odd 4-coloring of outerplanar graphs
by: Kashima, Masaki, et al.
Published: (2024)

Truncated degree DP-colourability of $K_{2,4}$-minor free graphs
by: Lo, On-Hei Solomon, et al.
Published: (2023)

Flexible DP-4-coloring of planar graphs without 4-cycles and intersecting triangles
by: Fang, Shu, et al.
Published: (2026)

Planar graphs with distance of 3-cycles at least 2 and no cycles of lengths 5, 6, 7
by: Wang, Tao, et al.
Published: (2025)

Planar graphs without 4-, 7-, 9-cycles and 5-cycles normally adjacent to 3-cycles
by: Liu, Zhengjiao, et al.
Published: (2025)

Bound on shortest cycle covers
by: Song, Deping, et al.
Published: (2024)

Minimum non-chromatic-choosable graphs with given chromatic number
by: Zhu, Jialu, et al.
Published: (2022)

Truncated degree AT-orientations of outerplanar graphs
by: Deng, Chenglong, et al.
Published: (2024)

List colouring triangle free planar graphs
by: Hu, Jianzhang, et al.
Published: (2019)

Degree-truncated choosability of graphs
by: Zhou, Huan, et al.
Published: (2025)

Degree-truncated choosability of planar graphs
by: Jiang, Yiting, et al.
Published: (2024)

Arc weighted acyclic orientations and variations of degeneracy of graphs
by: Zhou, Huan, et al.
Published: (2023)

On graphs without cycles of length 1 modulo 3
by: Bai, Yandong, et al.
Published: (2025)

On 2-connected graphs without cycles of length 1 modulo 3
by: Bai, Yandong, et al.
Published: (2026)

The square of every subcubic planar graph without 4-cycles and 5-cycles is 7-choosable
by: Jin, Ligang, et al.
Published: (2025)

Minimum saturated graphs without $4$-cycles and $5$-cycles
by: Ma, Yue
Published: (2025)

A survey on Hedetniemi's conjecture
by: Zhu, Xuding
Published: (2025)

List packing of graphs with bounded tree-width
by: Kashima, Masaki, et al.
Published: (2026)

Some orientation theorems for restricted DP-colorings of graphs
by: Gossett, Ian
Published: (2023)

The DP-coloring of the square of subcubic graphs
by: Zhao, Ren
Published: (2024)

Indicated list colouring game on graphs
by: Gu, Yangyan, et al.
Published: (2025)

On Alon-Tarsi orientations of sparse graphs
by: Cho, Eun-Kyung, et al.
Published: (2025)

Planar cycle-extendable graphs
by: Dalwadi, Aditya Y, et al.
Published: (2024)

On $2$-connected graphs avoiding cycles of length $0$ modulo $4$
by: Chu, Hojin, et al.
Published: (2025)

Squares of subcubic planar graphs without cycles of length 4-8 are 6-choosable
by: Kim, Seog-Jin, et al.
Published: (2025)

Triangles in graphs without the expansion of $4$-cycle
by: Song, Jialei, et al.
Published: (2026)

Planar graphs with the maximum number of induced 6-cycles
by: Savery, Michael
Published: (2021)

An introduction to equitable DP coloring of graphs
by: Kierstead, H. A., et al.
Published: (2026)

Structure and coloring of a family of ($P_7, C_5$)-free graphs
by: Chen, Ran, et al.
Published: (2023)

Subcubic $K_4$-minor-free graphs without crumby colorings
by: Pintér, József
Published: (2026)

Colouring signed analogues of Kneser, Schrijver, and Borsuk graphs
by: Kuffner, Luis, et al.
Published: (2024)

Acyclic sets and colorings in digraphs under restrictions on degrees and cycle lengths
by: Harutyunyan, Ararat, et al.
Published: (2026)

Generalized DP-colorings of digraphs
by: Picasarri-Arrieta, Lucas, et al.
Published: (2025)

The square of a subcubic planar graph without a 5-cycle is 7-choosable
by: Kim, Seog-Jin, et al.
Published: (2025)

Bounds for DP color function and canonical labelings
by: Li, Ziqing, et al.
Published: (2022)

Toroidal graphs without $K_{5}^{-}$ and 6-cycles
by: Chen, Ping, et al.
Published: (2025)

Max-Bisections of graphs without even cycles
by: Hou, Jianfeng, et al.
Published: (2025)

A note on two cycles of consecutive even lengths in graphs
by: Li, Binlong, et al.
Published: (2025)

Balanced clique subdivisions and cycles lengths in $K_{s, t}$-free graphs
by: Hou, Jianfeng, et al.
Published: (2024)