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

DOI10.1007/S00373-019-02025-2MaRDI QIDQ2000564zbMATH OpenOpenAlexFDO

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

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

list coloringplanar graphsdischargingDP-3-coloring

Mathematics Subject Classification ID

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

Recommendations

• DP-3-coloring of planar graphs without certain cycles
• DP-coloring on planar graphs without given adjacent short cycles
• DP-4-coloring of planar graphs with some restrictions on cycles
• Planar graphs without cycles of length from 4 to 7 and intersecting triangles are DP-3-colorable
• DP-4-colorability of planar graphs without adjacent cycles of given length

Cites work

• scientific article; zbMATH DE number 3735847 (Why is no real title available?)
• scientific article; zbMATH DE number 3563170 (Why is no real title available?)
• 3-list-coloring planar graphs of girth 5
• A note on 3-choosability of planar graphs
• A note on a Brooks' type theorem for DP-coloring
• A sufficient condition for a planar graph to be 3-choosable
• Colorings and orientations of graphs
• Correspondence coloring and its application to list-coloring planar graphs without cycles of lengths 4 to 8
• DP-3-coloring of some planar graphs
• Every planar graph is 5-choosable
• Every planar graph without 4-cycles adjacent to two triangles is DP-4-colorable
• Planar graphs without 4-cycles adjacent to triangles are DP-4-colorable
• Planar graphs without cycles of length 4, 7, 8, or 9 are 3-choosable
• Planar graphs without cycles of lengths 4 and 5 and close triangles are DP-3-colorable
• Sharp Dirac's theorem for DP-critical graphs

Cited in

(21)

• Every planar graph without 5-cycles adjacent to 6-cycles is DP-4-colorable
• Weak degeneracy of planar graphs without 4- and 6-cycles
• A weak DP-coloring of planar graphs without 4- and 9-cycles
• Sufficient conditions on planar graphs to have a relaxed DP-3-coloring
• The 3-colorability of planar graphs without cycles of length 4, 6 and 9
• Differences between the list-coloring and DP-coloring for planar graphs
• On the 3-colorability of planar graphs without \(\{4,8,9\}\)-cycles
• Multiple DP-coloring of planar graphs without 3-cycles and normally adjacent 4-cycles
• Planar graphs having no cycle of length 4, 7, or 9 are DP-3-colorable
• Relaxed DP-3-coloring of planar graphs without some cycles
• Sufficient conditions for planar graphs without 4-cycles and 5-cycles to be 2-degenerate
• Planar graphs without cycles of lengths 4 and 5 and close triangles are DP-3-colorable
• Planar graphs without \(\{4, 6, 8\}\)-cycles are 3-choosable
• DP-coloring on planar graphs without given adjacent short cycles
• DP-4-coloring of planar graphs with some restrictions on cycles
• Edge DP-coloring in planar graphs
• Planar graphs without normally adjacent short cycles
• DP-\(4\)-colorability of planar graphs without intersecting \(5\)-cycles
• A generalization of some results on list coloring and DP-coloring
• DP-3-coloring of planar graphs without certain cycles
• Planar graphs without specific cycles are 2-degenerate

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\}\)

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