DP-\(4\)-colorability of planar graphs without intersecting \(5\)-cycles

DOI10.1016/j.disc.2021.112790zbMath1482.05115OpenAlexW4206287059MaRDI QIDQ2075538

Mao Zhang, Xiangwen Li, Jian-Bo Lv

Publication date: 14 February 2022

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2021.112790

zbMATH Keywords

planar graphslist coloringDP-coloring

Mathematics Subject Classification ID

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

Related Items (2)

A sufficient condition for planar graphs to be DP-4-colorable ⋮ Unnamed Item

Cites Work

• Unnamed Item
• Correspondence coloring and its application to list-coloring planar graphs without cycles of lengths 4 to 8
• Colorings and orientations of graphs
• Every planar graph is 5-choosable
• DP-3-coloring of some planar graphs
• Every planar graph without 4-cycles adjacent to two triangles is DP-4-colorable
• A sufficient condition for DP-4-colorability
• Every planar graph without pairwise adjacent 3-, 4-, and 5-cycle is DP-4-colorable
• DP-3-coloring of planar graphs without 4, 9-cycles and cycles of two lengths from \(\{6,7,8\}\)
• Planar graphs without 4-cycles adjacent to triangles are DP-4-colorable
• Planar graphs without 7-cycles and butterflies are DP-4-colorable
• DP-4-colorability of planar graphs without adjacent cycles of given length
• Planar graphs without cycles of lengths 4 and 5 and close triangles are DP-3-colorable
• DP-4-colorability of two classes of planar graphs
• On DP-coloring of graphs and multigraphs
• Planar graphs without intersecting 5-cycles are 4-choosable
• The asymptotic behavior of the correspondence chromatic number

This page was built for publication: DP-\(4\)-colorability of planar graphs without intersecting \(5\)-cycles