Boundedness for proper conflict-free and odd colorings

Andrea Jiménez, Kolja Knauer, Carla Negri Lintzmayer +7

The proper conflict-free chromatic number, ${\chi }_{pcf}(G)$, of a graph $G$ is the least $k$ such that $G$ has a proper $k$-coloring in which for each non-isolated vertex there is a co…