Complexity and algorithms for proper conflict-free coloring in graphs

Dinabandhu Pradhan, Vaishali Sharma

A proper conflict-free (PCF) $k$-coloring of a graph $G$ is a proper $k$-coloring such that there exists a color that appears exactly once in the neighborhood of every non-isolated…