Multiple DP-coloring of planar graphs without 3-cycles and normally adjacent 4-cycles

DOI10.1007/S00373-022-02575-YzbMATH Open1504.05103arXiv2201.12028OpenAlexW4304690601MaRDI QIDQ2084793FDOQ2084793

Authors: Huan Zhou, Xuding Zhu 

Publication date: 13 October 2022

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Abstract: The concept of DP-coloring of a graph is a generalization of list coloring introduced by Dvov{r}'{a}k and Postle in 2015. Multiple DP-coloring of graphs, as a generalization of multiple list coloring, was first studied by Bernshteyn, Kostochka and Zhu in 2019. This paper proves that planar graphs without 3-cycles and normally adjacent 4-cycles are $(7m,2m)$-DP-colorable for every integer $m$. As a consequence, the strong fractional choice number of any planar graph without 3-cycles and normally adjacent 4-cycles is at most $7/2$.

Full work available at URL: https://arxiv.org/abs/2201.12028

Recommendations

• DP-3-coloring of planar graphs without 4, 9-cycles and cycles of two lengths from \(\{6,7,8\}\)
• DP-coloring on planar graphs without given adjacent short cycles
• Planar graphs without 4-cycles adjacent to triangles are DP-4-colorable
• DP-4-colorability of planar graphs without adjacent cycles of given length
• Every planar graph without pairwise adjacent 3-, 4-, and 5-cycle is DP-4-colorable

zbMATH Keywords

cyclesplanar graphfractional coloringDP-coloringstrong fractional choice number

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15) Paths and cycles (05C38)

Cites Work

• Choosability and fractional chromatic numbers
• Multiple list colouring of planar graphs
• Correspondence coloring and its application to list-coloring planar graphs without cycles of lengths 4 to 8
• Planar graphs are \(9/2\)-colorable
• Fractional DP-colorings of sparse graphs
• Multiple list colouring triangle free planar graphs
• Every planar graph is 1-defective \((9,2)\)-paintable

Cited In (1)

• Edge DP-coloring in planar graphs

This page was built for publication: Multiple DP-coloring of planar graphs without 3-cycles and normally adjacent 4-cycles

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2084793)