Edge-Removal and Non-Crossing Configurations in Geometric Graphs
2010 ◽
Vol Vol. 12 no. 1
(Graph and Algorithms)
◽
Keyword(s):
Graphs and Algorithms International audience A 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.
2015 ◽
Vol Vol. 17 no.2
(Graph Theory)
◽
Keyword(s):
Keyword(s):
2019 ◽
Vol 12
(01)
◽
pp. 2050005
2005 ◽
Vol DMTCS Proceedings vol. AE,...
(Proceedings)
◽
Keyword(s):
2013 ◽
Vol Vol. 15 no. 1
(Combinatorics)
◽
Keyword(s):
2010 ◽
Vol 20
(05)
◽
pp. 577-600
◽
Keyword(s):
2000 ◽
Vol 43
(4)
◽
pp. 437-440
◽
Keyword(s):