Odd coloring graphs with linear neighborhood complexity

Abstract

We prove that any class of graphs with linear neighborhood complexity has bounded improper odd chromatic number. As a result, if $\mathcal{G}$ is the class of all circle graphs, or if $\mathcal{G}$ is any class with bounded twin-width, bounded merge-width, or a forbidden vertex-minor, then $\mathcal{G}$ is $\ddot{I}{‡}_{\mathrm{o}}$-bounded.

16 pages, 1 figure