Shaily Verma

On the Classical and Parameterized Complexity of Strong Odd Coloring

A strong odd $k$-coloring of a graph $G$ is a proper $k$-coloring such that every color appearing in the neighborhood of a non-isolated vertex appears an odd number of times. The minimum $k$ for which $G$ admits a strong odd $k$-coloring is the \emph{strong odd chromatic number}, denoted by $\chi_{\text{so}}(G)$, of $G...