The local chromatic number of a graph G, as introduced in , is the minimum integer k such that G admits a proper coloring (with an arbitrary number of colors) in which the neighborhood of each vertex uses less than k colors. In  a connection of the local chromatic number to topological properties of (a box complex of) the graph was established and in  it was shown that a topological condition implying the usual chromatic number being at least four has the stronger consequence that the local chromatic number is also at least four. As a consequence one obtains a generalization of the following theorem of Youngs : If a quadrangulation of the projective plane is not bipartite it has chromatic number four. The generalization states that in this case the local chromatic number is also four. Both papers  and  generalize Youngs' result to arbitrary non-orientable surfaces replacing the condition of the graph being not bipartite by a more technical condition of an odd quadrangulation. This paper investigates when these general results are true for the local chromatic number instead of the chromatic number. Surprisingly, we find out that (unlike in the case of the chromatic number) this depends on the genus of the surface. For the non-orientable surfaces of genus at most four, the local chromatic number of any odd quadrangulation is at least four, but this is not true for non-orientable surfaces of genus 5 or higher. We also prove that face subdivisions of odd quadrangulations and Fisk triangulations of arbitrary surfaces exhibit the same behavior for the local chromatic number as they do for the usual chromatic number.
ASJC Scopus subject areas
- Discrete Mathematics and Combinatorics
- Computational Mathematics