Conflict-Free Coloring on Open Neighborhoods

Sriram Bhyravarapu, Subrahmanyam Kalyanasundaram

In an undirected graph, a conflict-free coloring (with respect to open neighborhoods) is an assignment of colors to the vertices of the graph $G$ such that every vertex in $G$ has…