On the Parameterized Complexity of Odd Coloring

Sriram Bhyravarapu, Swati Kumari, I. Vinod Reddy

A proper vertex coloring of a connected graph $G$ is called an odd coloring if, for every vertex $v$ in $G$, there exists a color that appears odd number of times in the open neigh…