János Pach, Gábor Tardos. Conflict-Free Colourings of Graphs and Hypergraphs. Combinatorics, Probability & Computing, 18(5):819-834, 2009. [doi]
@article{PachT09-1,
title = {Conflict-Free Colourings of Graphs and Hypergraphs},
author = {János Pach and Gábor Tardos},
year = {2009},
doi = {10.1017/S0963548309990290},
url = {http://dx.doi.org/10.1017/S0963548309990290},
tags = {graph-rewriting, rewriting},
researchr = {https://researchr.org/publication/PachT09-1},
cites = {0},
citedby = {0},
journal = {Combinatorics, Probability & Computing},
volume = {18},
number = {5},
pages = {819-834},
}