On a conjecture about the strong odd chromatic number of planar graphs

Arun J Manattu, Athira Vinay, Aparna Lakshmanan S

A proper coloring of a graph $G$ is said to be a strong odd coloring of $G$, if for every vertex $v$ and every color $c$, either $c$ appears on an odd number of vertices in the nei…