Conflict-Free Colourings of Graphs and Hypergraphs

János Pach, Gábor Tardos. Conflict-Free Colourings of Graphs and Hypergraphs. Combinatorics, Probability & Computing, 18(5):819-834, 2009. [doi]

Abstract

Abstract is missing.