1-planar graphs are odd 13-colorable (Q6041551)

An odd \(k\)-coloring is a proper \(k\)-coloring if for every vertex \(v\) with \(d(v)\geq1\), there is a color appearing odd times in its neighbors. \textit{M. Petruševski} and \textit{R. Škrekovski} [Discrete Appl. Math. 321, 385--391 (2022; Zbl 1497.05096)] first introduced the odd coloring and proved that planar graphs have an odd \(9\)-coloring. A graph is called \(1\)-planar if it could be embedded into a plane so that each edge is crossed not more than once. \textit{D. W. Cranston} et al. [Discrete Appl. Math. 330, 112--117 (2023; Zbl 1514.05058)] proved that \(1\)-planar graphs have an odd \(23\)-coloring. This paper gives the stronger result that \(1\)-planar graphs have an odd \(13\)-coloring.