Edge-Removal and Non-Crossing Configurations in Geometric Graphs
Visualitza/Obre
Estadístiques de LA Referencia / Recolecta
Inclou dades d'ús des de 2022
Cita com:
hdl:2117/8079
Tipus de documentArticle
Data publicació2010
Condicions d'accésAccés obert
Llevat que s'hi indiqui el contrari, els
continguts d'aquesta obra estan subjectes a la llicència de Creative Commons
:
Reconeixement-NoComercial-SenseObraDerivada 3.0 Espanya
Abstract
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.
CitacióAichholzer, O. [et al.]. Edge-Removal and Non-Crossing Configurations in Geometric Graphs. "Discrete mathematics and theoretical computer science", 2010, vol. 12, núm. 1, p. 75-86.
ISSN1365-8050
Versió de l'editorhttp://www.dmtcs.org/dmtcs-ojs/index.php/dmtcs/article/view/985/2880
Fitxers | Descripció | Mida | Format | Visualitza |
---|---|---|---|---|
huemer_dmtcs.pdf | 182,1Kb | Visualitza/Obre |