Conflict-Free Coloring of Intersection Graphs
S\'andor P. Fekete, Phillip Keldenich

TL;DR
This paper investigates conflict-free coloring in geometric intersection graphs, revealing complexity results, bounds on the number of colors needed, and proposing algorithms and conjectures for specific graph classes.
Contribution
It provides new bounds, complexity results, and algorithms for conflict-free coloring in geometric intersection graphs, including NP-completeness and tight bounds for certain classes.
Findings
Conflict-free chromatic number can be as high as (rac{\u221a{ }n}) for some geometric graphs.
Deciding one-color conflict-free coloring in unit-disk graphs is NP-complete.
Six colors suffice for unit disk graphs of restricted height, with a conjecture that four are enough.
Abstract
A conflict-free -coloring of a graph assigns one of different colors to some of the vertices such that, for every vertex , there is a color that is assigned to exactly one vertex among and 's neighbors. Such colorings have applications in wireless networking, robotics, and geometry, and are well studied in graph theory. Here we study the conflict-free coloring of geometric intersection graphs. We demonstrate that the intersection graph of geometric objects without fatness properties and size restrictions may have conflict-free chromatic number in and in for disks or squares of different sizes; it is known for general graphs that the worst case is in . For unit-disk intersection graphs, we prove that it is NP-complete to decide the existence of a conflict-free coloring with one color; we…
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.
