Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms

Conflict-Free Coloring of Intersection Graphs of Geometric Objects


In FOCS’2002, Even et al. introduced and studied the notion of conflict-free colorings of geometrically defined hypergraphs. They motivated it by frequency assignment problems in cellular networks. This notion has been extensively studied since then.
A conflict-free coloring of a graph is a coloring of its vertices such that the neighborhood (pointed or closed) of each vertex contains a vertex whose color differs from the colors of all other vertices in that neighborhood. In this paper we study conflict-free colorings of intersection graphs of geometric objects. We show that any intersection graph of n pseudo-discs in the plane admits a conflict-free coloring with O(log n) colors, with respect to both closed and pointed neighborhoods. We also show that the latter bound is asymptotically sharp.
Using our methods, we obtain the following strengthening of the two main results of Even et al.: Any family F of n discs in the plane can be colored with O(log n) colors in such a way that for any disc B in the plane, the set of discs in F that intersect B contains a uniquely-colored element. Moreover, such a coloring can be computed deterministically in polynomial time. In view of the original motivation to study such colorings, this strengthening suggests further applications to frequency assignment in wireless networks.
Finally, we present bounds on the number of colors needed for conflict-free colorings of other classes of intersection graphs, including intersection graphs of axis-parallel rectangles and of ρ-fat objects in the plane.

Get full access to this article

View all available purchase options and get full access to this chapter.

Information & Authors


Published In

cover image Proceedings
Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms
Pages: 2397 - 2411
Editor: Artur Czumaj, University of Warwick, United Kingdom
ISBN (Online): 978-1-61197-503-1


Published online: 2 January 2018



Metrics & Citations



If you have the appropriate software installed, you can download article citation data to the citation manager of your choice. Simply select your manager software from the list below and click Download.

Cited By

There are no citations for this item

View Options

Get Access

View options


View PDF







Copy the content Link

Share with email

Email a colleague

Share on social media

The SIAM Publications Library now uses SIAM Single Sign-On for individuals. If you do not have existing SIAM credentials, create your SIAM account