Proper Conflict-Free Choosability for Graphs with Bounded Average Degree

Zhijun Lu, Qirui Ying, Huimin Song

For a graph $G$, a proper coloring of $G$ is called proper conflict-free if for every non-isolated vertex $u$, there is at least one color appearing exactly once in $N_G(u)$. A gra…