Conflict-free coloring and its applications

Research output: Chapter in Book/Report/Conference proceedingChapterpeer-review

30 Scopus citations

Abstract

Let H = (V, E) be a hypergraph. A conflict-free coloring of H is an assignment of colors to V such that, in each hyperedge e ∈ E, there is at least one uniquely-colored vertex. This notion is an extension of the classical graph coloring. Such colorings arise in the context of frequency assignment to cellular antennae, in battery consumption aspects of sensor networks, in RFID protocols, and several other fields. Conflict-free coloring has been the focus of many recent research papers. In this paper, we survey this notion and its combinatorial and algorithmic aspects.

Original languageEnglish
Title of host publicationBolyai Society Mathematical Studies
PublisherSpringer Berlin Heidelberg
Pages331-389
Number of pages59
DOIs
StatePublished - 1 Jan 2013

Publication series

NameBolyai Society Mathematical Studies
Volume24
ISSN (Print)1217-4696

Fingerprint

Dive into the research topics of 'Conflict-free coloring and its applications'. Together they form a unique fingerprint.

Cite this