A weak DP-coloring of planar graphs without 4- and 9-cycles

DOI10.1016/j.dam.2023.10.004MaRDI QIDQ6184347

Mingfang Huang, Yang Xiao

Publication date: 24 January 2024

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

zbMATH Keywords

discharging methoddefective coloringvertex-partitionweak DP-coloring

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Coloring of graphs and hypergraphs (05C15)

Cites Work

• Correspondence coloring and its application to list-coloring planar graphs without cycles of lengths 4 to 8
• DP-3-coloring of some planar graphs
• DP-3-coloring of planar graphs without 4, 9-cycles and cycles of two lengths from \(\{6,7,8\}\)
• Sufficient conditions on planar graphs to have a relaxed DP-3-coloring
• DP-3-coloring of planar graphs without certain cycles
• 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
• On 2-defective DP-colorings of sparse graphs
• Defective DP-colorings of sparse multigraphs
• Defective DP-colorings of sparse simple graphs
• The Alon-Tarsi number of planar graphs without cycles of lengths 4 and \(l\)
• Planar graphs without cycles of lengths 4 and 5 and close triangles are DP-3-colorable
• On DP-coloring of graphs and multigraphs
• Decomposition of planar graphs with forbidden configurations
• A weak DP-partitioning of planar graphs without 4-cycles and 6-cycles