Akademska digitalna zbirka SLovenije - logo
VSE knjižnice (vzajemna bibliografsko-kataložna baza podatkov COBIB.SI)
  • Edge-removal and non-crossing configurations in geometric graphs [Elektronski vir]
    Aichholzer, Oswin ...
    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.
    Vir: Preprint series. - ISSN 1318-4865 (Vol. 46, št. 1052, 2008, str. 1-11)
    Vrsta gradiva - e-članek
    Leto - 2008
    Jezik - angleški
    COBISS.SI-ID - 14731353

    Povezava(-e):

    http://www.imfm.si/preprinti/PDF/01052.pdf

Vnos na polico