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

Sriram Bhyravarapu, Tim A. Hartmann, Hung P. Hoang +2

A conflict-free coloring of a graph $G$ is a (partial) coloring of its vertices such that every vertex $u$ has a neighbor whose assigned color is unique in the neighborhood of $u$.…