Geometric graph homomorphisms

Abstract

AbstractA geometric graph is a simple graph drawn on points in the plane, in general position, with straightline edges. A geometric homomorphism from to is a vertex map that preserves adjacencies and crossings. This work proves some basic properties of geometric homomorphisms and defines the geochromatic number as the minimum n so that there is a geometric homomorphism from to a geometric n‐clique. The geochromatic number is related to both the chromatic number and to the minimum number of plane layers of . By providing an infinite family of bipartite geometric graphs, each of which is constructed of two plane layers, which take on all possible values of geochromatic number, we show that these relationships do not determine the geochromatic number. This article also gives necessary (but not sufficient) and sufficient (but not necessary) conditions for a geometric graph to have geochromatic number at most four. As a corollary, we get precise criteria for a bipartite geometric graph to have geochromatic number at most four. This article also gives criteria for a geometric graph to be homomorphic to certain geometric realizations of K2, 2 and K3, 3. © 2011 Wiley Periodicals, Inc. J Graph Theory 69:97‐113, 2012