Conflict-Free Coloring: Graphs of Bounded Clique-Width and Intersection Graphs

Bhyravarapu, Sriram; Hartmann, Tim A.; Hoang, Hung P.; Kalyanasundaram, Subrahmanyam; Reddy, I. Vinod

doi:10.1007/S00453-024-01227-2

by Sriram Bhyravarapu, Tim A. Hartmann, Hung P. Hoang, Subrahmanyam Kalyanasundaram, I. Vinod Reddy

Reference:

Conflict-Free Coloring: Graphs of Bounded Clique-Width and Intersection GraphsSriram Bhyravarapu, Tim A. Hartmann, Hung P. Hoang, Subrahmanyam Kalyanasundaram, I. Vinod ReddyAlgorithmica, volume 86, number 7, pages 2250–2288, 2024.

Bibtex Entry:

@article{BhyravarapuHHKR24,
  author       = {Sriram Bhyravarapu and
                  Tim A. Hartmann and
                  Hung P. Hoang and
                  Subrahmanyam Kalyanasundaram and
                  I. Vinod Reddy},
  title        = {Conflict-Free Coloring: Graphs of Bounded Clique-Width and Intersection
                  Graphs},
  journal      = {Algorithmica},
  volume       = {86},
  number       = {7},
  pages        = {2250--2288},
  year         = {2024},
  url          = {https://doi.org/10.1007/s00453-024-01227-2},
  doi          = {10.1007/S00453-024-01227-2},
  timestamp    = {Wed, 24 Jul 2024 21:43:38 +0200},
  biburl       = {https://dblp.org/rec/journals/algorithmica/BhyravarapuHHKR24.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org},
  keywords = {ParAI}
}