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

DOI10.1007/S00373-019-02038-XzbMATH Open1416.05117arXiv1803.03527OpenAlexW2962914686MaRDI QIDQ2000575FDOQ2000575

Authors: Pongpat Sittitrai, Kittikorn Nakprasit 

Publication date: 28 June 2019

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

Abstract: It is known that DP-coloring is a generalization of a list coloring in simple graphs and many results in list coloring can be generalized in those of DP-coloring. In this work, we introduce a relaxed DP-coloring which is a generalization if a relaxed list coloring. We also shows that every planar graph $G$ without $4$-cycles or $6$-cycles is DP-$(k,d{)}^{*}$-colorable. It follows immediately that $G$ is $(k,d{)}^{*}$-choosable.

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

Recommendations

• Relaxed DP-3-coloring of planar graphs without some cycles
• A sufficient condition for DP-4-colorability
• DP-3-coloring of planar graphs without 4, 9-cycles and cycles of two lengths from \(\{6,7,8\}\)
• Relaxed DP-coloring and another generalization of DP-coloring on planar graphs without 4-cycles and 7-cycles
• DP-3-coloring of planar graphs without certain cycles

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)

Cites Work

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

Cited In (6)

• Relaxed DP-coloring and another generalization of DP-coloring on planar graphs without 4-cycles and 7-cycles
• 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
• A generalization of some results on list coloring and DP-coloring
• Relaxed DP-3-coloring of planar graphs without some cycles
• Defective DP-colorings of sparse multigraphs

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

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