Abstrakt
Graph-theoretic properties of certain proximity graphs defined on planar point sets are investigated. We first consider some of the most common proximity graphs of the family of the Delaunay graph, and study their number of edges, minimum and maximum degree, clique number, and chromatic number.
In the second part of the paper we focus on the higher order versions of some of these graphs and give bounds on the same parameters.