Extremal Results on Conflict-free Coloring

Sriram Bhyravarapu, Shiwali Gupta, Subrahmanyam Kalyanasundaram +1

A conflict-free open neighborhood coloring of a graph is an assignment of colors to the vertices such that for every vertex there is a color that appears exactly once in its open n…