Conflict-Free Colouring of Graphs

Roman Glebov, Tibor Szabó, Gábor Tardos. Conflict-Free Colouring of Graphs. Combinatorics, Probability & Computing, 23(3):434-448, 2014. [doi]

@article{GlebovST14,
  title = {Conflict-Free Colouring of Graphs},
  author = {Roman Glebov and Tibor Szabó and Gábor Tardos},
  year = {2014},
  doi = {10.1017/S0963548313000540},
  url = {http://dx.doi.org/10.1017/S0963548313000540},
  researchr = {https://researchr.org/publication/GlebovST14},
  cites = {0},
  citedby = {0},
  journal = {Combinatorics, Probability & Computing},
  volume = {23},
  number = {3},
  pages = {434-448},
}