Search Constraints

Filtering by: Creator Saumell, Maria Remove constraint Creator: Saumell, Maria

Search Results

  • Work
    Article
    Matos, Inês
    We study biplane graphs drawn on a finite planar point set \(S\) in general position. This is the family of geometric graphs whose vertex set is \(S\) and can be decomposed into two plane graphs. We show that two maximal biplane graphs—in the sense th . . .
  • Work
    Article
    Saumell, Maria
    Let P be a set of n points in the plane. A geometric proximity graph on P is a graph where two points are connected by a straight-line segment if they satisfy some prescribed proximity rule. We consider four classes of higher order proximity graphs, n . . .
  • Work
    Article
    Yarborough, Jonathan R.
    Resistance to heavy metals is important for the survival of bacteria in contaminated environments. In this study, we show that the unicellular cyanobacterial species Synechococcus sp. IU 625 adapts to growth in the presence of mercuric chloride, recov . . .
  • 7h149s73r?file=thumbnail
    Article
    Meijer, Henk
    Given a large weighted graph G = (V, E) and a subset U of V , we define several graphs with vertex set U in which two vertices are adjacent if they satisfy some prescribed proximity rule. These rules use the shortest path distance in G and generalize . . .
  • Work
    Article
    Sacristán, Vera
    Let P be a set of n points in the plane. A geometric proximity graph on P is a graph where two points are connected by a straight-line segment if they satisfy some prescribed proximity rule. We consider four classes of higher order proximity graphs, n . . .
  • Work
    Article
    Silveira, Rodrigo I.
    We study biplane graphs drawn on a finite point set S in the plane in general position. This is the family of geometric graphs whose vertex set is S and which can be decomposed into two plane graphs. We show that every sufficiently large point set adm . . .