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

作者：Xiao, Yang; Huang, Mingfang^*

来源：Discrete Applied Mathematics, 2024, 342: 391-397.

DOI：10.1016/j.dam.2023.10.004

• Weak DP-coloring
• Defective coloring
• Vertex-partition
• Discharging method

A weak DP-coloring is a new coloring combining DP-coloring and vertex-partition, which was introduced by Sittitrai and Nakprasit. Sribunhung et al. proved that planar graphs without 4-and 7-cycles are weakly DP-(F2, F2, F0)-colorable. Fang and Wang proved that planar graphs without 4, 6-cycles or 4, 8-cycles are weakly DP-(F2, F2, F0)-colorable. In this paper, we show that planar graphs without 4-and 9-cycles are weakly DP-(F2,F2,F0)-colorable.

• 单位
  武汉理工大学