2 papers
math.CO2026
Proper conflict-free choosability of sparse graphs with girth at least seven
Xingqin Qi, Huimin Song, Zhulou Cao
A proper conflict-free coloring is a proper vertex coloring in which every non-isolated vertex has a color appearing exactly once in its open neighborhood. We prove that every fini…
math.CO2026
Proper Conflict-Free Choosability for Graphs with Bounded Average Degree
Zhijun Lu, Qirui Ying, Huimin Song
For a graph , a proper coloring of is called proper conflict-free if for every non-isolated vertex , there is at least one color appearing exactly once in . A gra…