Add to ORKGA geometric graph is a graph G = (V;E) drawn in the plane, such that V is a point set in general position and E is a set of straight-line segments whose endpoints belong to V . We study the following extremal problem for geometric graphs: How many arbitrary edges can be removed from a complete geometric graph with n vertices such that the remaining graph still contains a certain non-crossing subgraph. The non-crossing subgraphs that we consider are perfect matchings, subtrees of a given size, and triangulations. In each case, we obtain tight bounds on the maximum number of removable edges
AbstractIn this paper, we present algorithms for enumerating, without repetitions, all triangulation...
AbstractA geometric graph is a graph embedded in the plane in such a way that vertices correspond to...
A geometric graph is a graph drawn in the plane so that the vertices are represented by points in g...
We study the following extremal problem for geomet-ric graphs: How many arbitrary edges can be remov...
A geometric graph is a graph G=(V,E) drawn in the plane so that the vertex set V consists of points...
A geometric graph is a graph G=(V,E) drawn in the plane so that the vertex set V consists of points...
A geometric graph is a graph G = (V; E) drawn in the plane so that the vertex set V consists of poin...
A geometric graph is a graph drawn in the plane with vertices represented by points and edges as str...
A geometric graph is a graph embedded in the plane in such a way that vertices correspond to points ...
Let G be a geometric graph on n vertices that are not necessarily in general position. Assume that n...
Let f(n, k) be the minimum number of edges that must be removed from some complete geometric graph G...
We show that there is a constant α> 0 such that, for any set P of n ≥ 5 points in general positio...
Communicated by János Pach. Abstract. A geometric graph is a graph G D.V; E / drawn in the plane so...
Given a graph G and a subset F ⊆ E(G) of its edges, is there a drawing of G in which all edges of F ...
Consider a set B of blue points and a set R of red points in the plane such that R ∪ B is in general...
AbstractIn this paper, we present algorithms for enumerating, without repetitions, all triangulation...
AbstractA geometric graph is a graph embedded in the plane in such a way that vertices correspond to...
A geometric graph is a graph drawn in the plane so that the vertices are represented by points in g...
We study the following extremal problem for geomet-ric graphs: How many arbitrary edges can be remov...
A geometric graph is a graph G=(V,E) drawn in the plane so that the vertex set V consists of points...
A geometric graph is a graph G=(V,E) drawn in the plane so that the vertex set V consists of points...
A geometric graph is a graph G = (V; E) drawn in the plane so that the vertex set V consists of poin...
A geometric graph is a graph drawn in the plane with vertices represented by points and edges as str...
A geometric graph is a graph embedded in the plane in such a way that vertices correspond to points ...
Let G be a geometric graph on n vertices that are not necessarily in general position. Assume that n...
Let f(n, k) be the minimum number of edges that must be removed from some complete geometric graph G...
We show that there is a constant α> 0 such that, for any set P of n ≥ 5 points in general positio...
Communicated by János Pach. Abstract. A geometric graph is a graph G D.V; E / drawn in the plane so...
Given a graph G and a subset F ⊆ E(G) of its edges, is there a drawing of G in which all edges of F ...
Consider a set B of blue points and a set R of red points in the plane such that R ∪ B is in general...
AbstractIn this paper, we present algorithms for enumerating, without repetitions, all triangulation...
AbstractA geometric graph is a graph embedded in the plane in such a way that vertices correspond to...
A geometric graph is a graph drawn in the plane so that the vertices are represented by points in g...