On strong odd colorings of graphs

Yair Caro, Mirko Petruševski, Riste Škrekovski +1

A strong odd coloring of a simple graph $G$ is a proper coloring of the vertices of $G$ such that for every vertex $v$ and every color $c$, either $c$ is used an odd number of time…