The odd chromatic number of a toroidal graph is at most 9

Abstract

It's well known that every planar graph is $4$-colorable. A toroidal graph is a graph that can be embedded on a torus. It's proved that every toroidal graph is $7$-colorable. A proper coloring of a graph is called \emph{odd} if every non-isolated vertex has at least one color that appears an odd number of times in its neighborhood. The smallest number of colors that admits an odd coloring of a graph $G$ is denoted by ${\chi }_o(G)$. In this paper, we prove that if $G$ is tortoidal, then ${\chi }_o\left(G\right)\le 9$; Note that $K_7$ is a toroidal graph, the upper bound is no less than $7$.

arXiv comment9 pages