Remarks on odd colorings of graphs

Abstract

A proper vertex coloring $\phi$ of graph $G$ is said to be odd if for each non-isolated vertex $x\in V(G)$ there exists a color $c$ such that ${\phi }^{-1}(c)\cap N(x)$ is odd-sized. The minimum number of colors in any odd coloring of $G$, denoted ${\chi }_o(G)$, is the odd chromatic number. Odd colorings were recently introduced in [M.~Petruševski, R.~Škrekovski: \textit{Colorings with neighborhood parity condition}]. Here we discuss various basic properties of this new graph parameter, characterize acyclic graphs and hypercubes in terms of odd chromatic number, establish several upper bounds in regard to degenericity or maximum degree, and pose several questions and problems.

15 pages, 1 figure