• Edge-Removal and Non-Crossing Configurations in Geometric Graphs 

    Aichholzer, Oswin; Cabello, Sergio; Fabila Monroy, Ruy; Flores Peñaloza, David; Hackl, Thomas; Huemer, Clemens; Hurtado Díaz, Fernando Alfredo; Wood, David (2010)
    Acceso abierto
    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 ...