Relaxed DP-coloring and another generalization of DP-coloring on planar graphs without 4-cycles and 7-cycles

DOI10.7151/dmgt.2405zbMath1504.05098OpenAlexW3159222189MaRDI QIDQ2107762

Kittikorn Nakprasit, Pongpat Sittitrai, Sarawute Sribunhung, Keaitsuda Maneeruk Nakprasit

Publication date: 2 December 2022

Published in: Discussiones Mathematicae. Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.7151/dmgt.2405

zbMATH Keywords

planar graphsdischargingvariable degeneracyrelaxed DP-colorings

Mathematics Subject Classification ID

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

Related Items (2)

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Correspondence coloring and its application to list-coloring planar graphs without cycles of lengths 4 to 8
• Variable degeneracy: Extensions of Brooks' and Gallai's theorems
• Sufficient conditions on planar graphs to have a relaxed DP-3-coloring
• An analogue of DP-coloring for variable degeneracy and its applications
• A generalization of some results on list coloring and DP-coloring
• On DP-coloring of graphs and multigraphs
• List Improper Colourings of Planar Graphs
• A note on list improper coloring planar graphs

This page was built for publication: Relaxed DP-coloring and another generalization of DP-coloring on planar graphs without 4-cycles and 7-cycles