Consider the following question: does every complete geometric graph K2n have a partition of its edge set into n plane spanning trees? We approach this problem from three directio...
A geometric graph is a simple graph G = (V, E) with an embedding of the set V in the plane such that the points that represent V are in general position. A geometric graph is said...
Given a set S of n points in RD , and an integer k such that 0 k < n, we show that a geometric graph with vertex set S, at most n − 1 + k edges, maximum degree five, and dila...
Boris Aronov, Mark de Berg, Otfried Cheong, Joachi...