1-planar graphs are odd 13-colorable

Runrun Liu, Weifan Wang, Gexin Yu

An odd coloring of a graph $G$ is a proper coloring such that any non-isolated vertex in $G$ has a coloring appears odd times on its neighbors. The odd chromatic number, denoted by…