DP-3-coloring of some planar graphs

DOI10.1016/j.disc.2018.09.025zbMath1400.05086arXiv1802.09312OpenAlexW2962803950WikidataQ129097711 ScholiaQ129097711MaRDI QIDQ1618234

Yuxue Yin, Gexin Yu, Runrun Liu, Sarah Loeb

Publication date: 13 November 2018

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

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

zbMATH Keywords

planar graphslist coloringDP-coloring

Mathematics Subject Classification ID

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

Related Items (22)

Planar graphs without normally adjacent short cycles ⋮ A deletion-contraction relation for the DP color function ⋮ Partial DP-coloring of graphs ⋮ Planar graphs without \(\{4, 6, 8\}\)-cycles are 3-choosable ⋮ Weak degeneracy of planar graphs without 4- and 6-cycles ⋮ A weak DP-coloring of planar graphs without 4- and 9-cycles ⋮ An algebraic approach for counting DP-3-colorings of sparse graphs ⋮ Non-chromatic-adherence of the DP color function via generalized theta graphs ⋮ Unnamed Item ⋮ Every planar graph without 4-cycles adjacent to two triangles is DP-4-colorable ⋮ On the chromatic polynomial and counting DP-colorings of graphs ⋮ 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 4, 9-cycles and cycles of two lengths from \(\{6,7,8\}\) ⋮ Combinatorial Nullstellensatz and DP-coloring of graphs ⋮ DP-3-coloring of planar graphs without certain cycles ⋮ Answers to two questions on the DP color function ⋮ Planar graphs without specific cycles are 2-degenerate ⋮ Planar graphs without cycles of length from 4 to 7 and intersecting triangles are DP-3-colorable ⋮ 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 ⋮ Every planar graph without adjacent cycles of length at most 8 is 3-choosable

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Correspondence coloring and its application to list-coloring planar graphs without cycles of lengths 4 to 8
• List colourings of planar graphs
• Every planar graph is 5-choosable
• A sufficient condition for DP-4-colorability
• The 3-choosability of plane graphs of girth 4
• 3-list-coloring planar graphs of girth 5
• A not 3-choosable planar graph without 3-cycles
• Colorings of plane graphs: a survey
• On DP-coloring of graphs and multigraphs
• DP-colorings of graphs with high chromatic number
• A note on 3-choosability of planar graphs without certain cycles
• The asymptotic behavior of the correspondence chromatic number
• Sharp Dirac's theorem for DP‐critical graphs

This page was built for publication: DP-3-coloring of some planar graphs