@article{GUO2023, 
author = {Chunqiang GUO and Baoyindureng WU},
title = {Odd Chromatic Number of a 1-Planar Graph is at Most 21},
year = {2023},
journal = {Journal of Xinjiang University(Natural Science Edition in Chinese and English)},
volume = {40},
number = {3},
pages = {267-273},
keywords = {proper coloring, odd coloring, 1-planar graph},
url = {https://www.sciopen.com/article/10.13568/j.cnki.651094.651316.2022.07.01.0001},
doi = {10.13568/j.cnki.651094.651316.2022.07.01.0001},
abstract = {A proper vertex coloring φ of a graph G is said to be odd if for each non-isolated vertex x ∈ V(G) there exists a color c such that |φ−1(c)∩NG(x)| is odd. A graph is 1-planar if it can be drawn in the plane so that each edge is crossed by at most one other edge. We prove every 1-planar graph admits an odd 21-coloring. This improves a recently obtained bound, 23, due to Cranston, Lafferty and Song.}
}