|
E-prints UPC >
Altres >
Enviament des de DRAC >
Empreu aquest identificador per citar o enllaçar aquest ítem:
http://hdl.handle.net/2117/8079
|
| 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. |
| Títol: | Edge-Removal and Non-Crossing Configurations in Geometric Graphs |
| Autor: | Aichholzer, Oswin; Cabello, Sergio; Fabila Monroy, Ruy; Flores Peñaloza, David; Hackl, Thomas; Huemer, Clemens  ; Hurtado Díaz, Fernando Alfredo ; Wood, David |
| Data: | 2010 |
| Tipus de document: | Article |
| Resum: | 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. |
| ISSN: | 1365-8050 |
| URI: | http://hdl.handle.net/2117/8079 |
| Versió de l'editor: | http://www.dmtcs.org/dmtcs-ojs/index.php/dmtcs/article/view/985/2880 |
| Apareix a les col·leccions: | Altres. Enviament des de DRAC
Departaments de Matemàtica Aplicada. Articles de revista
DCCG - Grup de recerca en geometria computacional, combinatoria i discreta. Articles de revista
|
| Comparteix: |
|
Aquest ítem (excepte textos i imatges no creats per l'autor) està subjecte a una llicència de Creative Commons Llicència Creative Commons
|
Català
Castellano
English
