Paper by Erik D. Demaine

Reference:

Zachary Abel, Victor Alvarez, Erik D. Demaine, Sándor Fekete, Aman Gour, Adam Hesterberg, Phillip Keldenich, and Christian Scheffer, “Conflict-Free Coloring of Graphs”, SIAM Journal on Discrete Mathematics, volume 32, number 4, 2018, pages 2675–2702.

BibTeX

@Article{ConflictFree_SIDMA,
  AUTHOR        = {Zachary Abel and Victor Alvarez and Erik D. Demaine and S{\'a}ndor Fekete and Aman Gour and Adam Hesterberg and Phillip Keldenich and Christian Scheffer},
  TITLE         = {Conflict-Free Coloring of Graphs},
  JOURNAL       = {SIAM Journal on Discrete Mathematics},
  journalurl    = {http://www.siam.org/journals/sidma/sidma.htm},
  VOLUME        = 32,
  NUMBER        = 4,
  PAGES         = {2675--2702},
  YEAR          = 2018,

  replaces      = {ConflictFree_SODA2017},
  papers        = {ConflictFree_SODA2017},
  doi           = {https://dx.doi.org/10.1137/17M1146579},
  dblp          = {https://dblp.org/rec/journals/siamdm/AbelADFGHKS18},
  comments      = {This paper is also available from <A HREF="https://doi.org/10.1137/17M1146579">SIAM</A>.},
}

Comments:

This paper is also available from SIAM.

Availability:

Currently unavailable. If you are in a rush for copies, contact me.

[Google Scholar search]

Related papers:

ConflictFree_SODA2017 (Three Colors Suffice: Conflict-Free Coloring of Planar Graphs)