Improper odd coloring of IC-planar graphs.

An IC-planar graph is a graph that can be drawn in the plane in such a way that each edge is crossed at most once and each vertex is incident with at most one crossed edge. In this paper, we show that every IC-planar graph can be colored with nine colors so that for every non-isolate vertex there exists a color occurring odd times in its neighbors. [ABSTRACT FROM AUTHOR]