Relaxed DP-3-coloring of planar graphs without some cycles
Huihui Fang, Tao Wang

TL;DR
This paper investigates relaxed DP-coloring of planar graphs, establishing new results on colorability when certain cycles are absent, extending previous work with improved conditions.
Contribution
It proves that planar graphs without 4, 6-cycles or 4, 8-cycles are DP-(0, 2, 2)-colorable, advancing understanding of relaxed DP-coloring under cycle restrictions.
Findings
Planar graphs without 4, 6-cycles are DP-(0, 2, 2)-colorable
Planar graphs without 4, 8-cycles are DP-(0, 2, 2)-colorable
Extends previous results on DP-coloring with cycle restrictions
Abstract
Dvo\v{r}\'{a}k and Postle introduced the concept of DP-coloring to overcome some difficulties in list coloring. Sittitrai and Nakprasit combined DP-coloring and defective list coloring to define a new coloring -- relaxed DP-coloring. For relaxed DP-coloring, Sribunhung et al. proved that planar graphs without 4- and 7-cycles are DP-(0, 2, 2)-colorable. Li et al. proved that planar graphs without 4, 8-cycles or 4, 9-cycles are DP-(1, 1, 1)-colorable. Lu and Zhu proved that planar graphs without 4, 5-cycles, or 4, 6-cycles, or 4, 7-cycles are DP-(1, 1, 1)-colorable. In this paper, we show that planar graphs without 4, 6-cycles or 4, 8-cycles are DP-(0, 2, 2)-colorable.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Graph Theory Research · Graph Labeling and Dimension Problems · graph theory and CDMA systems
