Conflict-free colorings of shallow discs

Research output: Contribution to journalArticlepeer-review

6 Scopus citations


We prove that any collection of n discs in which each one intersects at most k others, can be colored with at most O(log3 k) colors so that for each point p in the union of all discs there is at least one disc in the collection containing p whose color differs from that of all other members of the collection that contain p. This is motivated by a problem on frequency assignment in cellular networks, and improves the best previously known upper bound of O(log n) when k is much smaller than n.

Original languageEnglish
Pages (from-to)599-604
Number of pages6
JournalInternational Journal of Computational Geometry and Applications
Issue number6
StatePublished - 1 Dec 2008


  • Combinatorial geometry
  • Conflict-free colorings
  • Wireless networks

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Geometry and Topology
  • Computational Theory and Mathematics
  • Computational Mathematics
  • Applied Mathematics


Dive into the research topics of 'Conflict-free colorings of shallow discs'. Together they form a unique fingerprint.

Cite this