DP-3-coloring of planar graphs without 4, 9-cycles and cycles of two lengths from \(\{6,7,8\}\)

DOI10.1007/s00373-019-02025-2zbMath1416.05113OpenAlexW2921745586MaRDI QIDQ2000564

Yuxue Yin, Gexin Yu, Sarah Loeb, Runrun Liu, Martin Rolek

Publication date: 28 June 2019

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

Full work available at URL: https://doi.org/10.1007/s00373-019-02025-2

zbMATH Keywords

planar graphslist coloringdischargingDP-3-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) Distance in graphs (05C12)

Related Items

Planar graphs without normally adjacent short cycles ⋮ Planar graphs without \(\{4, 6, 8\}\)-cycles are 3-choosable ⋮ A generalization of some results on list coloring and DP-coloring ⋮ Weak degeneracy of planar graphs without 4- and 6-cycles ⋮ A weak DP-coloring of planar graphs without 4- and 9-cycles ⋮ Unnamed Item ⋮ Sufficient conditions for planar graphs without 4-cycles and 5-cycles to be 2-degenerate ⋮ DP-4-coloring of planar graphs with some restrictions on cycles ⋮ DP-3-coloring of planar graphs without certain cycles ⋮ Planar graphs without specific cycles are 2-degenerate ⋮ Planar graphs without cycles of lengths 4 and 5 and close triangles are DP-3-colorable ⋮ DP-\(4\)-colorability of planar graphs without intersecting \(5\)-cycles

Cites Work

• Unnamed Item
• Unnamed Item
• Planar graphs without cycles of length 4, 7, 8, or 9 are 3-choosable
• 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
• 3-list-coloring planar graphs of girth 5
• Planar graphs without 4-cycles adjacent to triangles are DP-4-colorable
• Planar graphs without cycles of lengths 4 and 5 and close triangles are DP-3-colorable
• A sufficient condition for a planar graph to be 3-choosable
• A note on 3-choosability of planar graphs
• Sharp Dirac's theorem for DP‐critical graphs
• A note on a Brooks' type theorem for DP‐coloring

This page was built for publication: DP-3-coloring of planar graphs without 4, 9-cycles and cycles of two lengths from \(\{6,7,8\}\)