Sufficient conditions on planar graphs to have a relaxed DP-3-coloring

DOI10.1007/s00373-019-02038-xzbMath1416.05117arXiv1803.03527OpenAlexW2962914686MaRDI QIDQ2000575

Kittikorn Nakprasit, Pongpat Sittitrai

Publication date: 28 June 2019

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

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

zbMATH Keywords

planar graphsDP-coloringimproper colorings

Mathematics Subject Classification ID

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

Related Items (6)

A generalization of some results on list coloring and DP-coloring ⋮ A weak DP-partitioning of planar graphs without 4-cycles and 6-cycles ⋮ A weak DP-coloring of planar graphs without 4- and 9-cycles ⋮ Defective DP-colorings of sparse multigraphs ⋮ Relaxed DP-3-coloring of planar graphs without some cycles ⋮ Relaxed DP-coloring and another generalization of DP-coloring on planar graphs without 4-cycles and 7-cycles

Cites Work

• Unnamed Item
• Unnamed Item
• A \((3,1)^\ast\)-choosable theorem on planar graphs
• Correspondence coloring and its application to list-coloring planar graphs without cycles of lengths 4 to 8
• List colourings of planar graphs
• On \((3, 1)^\ast\)-choosability of planar graphs without adjacent short cycles
• A note on list improper coloring of plane graphs
• Every planar graph is 5-choosable
• A sufficient condition for DP-4-colorability
• On DP-coloring of graphs and multigraphs
• Defective colorings of graphs in surfaces: Partitions into subgraphs of bounded valency
• List Improper Colourings of Planar Graphs
• Improper Choosability of Planar Graphs without 4-Cycles
• A note on list improper coloring planar graphs

This page was built for publication: Sufficient conditions on planar graphs to have a relaxed DP-3-coloring