FPT Algorithms for Conflict-free Coloring of Graphs and Chromatic Terrain Guarding

Akanksha Agrawal, Pradeesha Ashok, Meghana M Reddy +2

We present fixed parameter tractable algorithms for the conflict-free coloring problem on graphs. Given a graph $G=(V,E)$, \emph{conflict-free coloring} of $G$ refers to coloring a…