Brooks-type theorems for relaxations of square colorings
Eun-Kyung Cho, Ilkyoo Choi, Hyemin Kwon, Boram Park

TL;DR
This paper introduces new bounds for a relaxation of graph coloring called the proper conflict-free chromatic number, proving a Brooks-type theorem for various graph classes and improving previous results.
Contribution
The authors establish tighter upper bounds for the proper conflict-free chromatic number for graphs with large maximum degree and extend the Brooks-type conjecture to broader graph classes.
Findings
For graphs with maximum degree at least h+2, the proper conflict-free chromatic number is at most (h+1)Δ(G)-1.
The conjecture holds for chordal graphs and partially for quasi-line and claw-free graphs.
The results improve upon previous bounds for h-dynamic coloring and relaxations of square colorings.
Abstract
The following relaxation of proper coloring the square of a graph was recently introduced: for a positive integer , the proper -conflict-free chromatic number of a graph , denoted , is the minimum such that has a proper -coloring where every vertex has colors appearing exactly once on its neighborhood. Caro, Petru\v{s}evski, and \v{S}krekovski put forth a Brooks-type conjecture: if is a graph with , then . The best known result regarding the conjecture is , which is implied by a result of Pach and Tardos. We improve upon the aforementioned result for all , and also enlarge the class of graphs for which the conjecture is known to be true. Our main result is the following: for a graph , if , then $\chi_{pcf}^h(G)\le…
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
TopicsLimits and Structures in Graph Theory · Advanced Graph Theory Research
