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]

Authors

János Pach

This author has not been identified. Look up 'János Pach' in Google

Gábor Tardos

This author has not been identified. Look up 'Gábor Tardos' in Google