Search Constraints
Search Results

ArticleMatos, InêsWe 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 . . .

ArticleSaumell, MariaLet 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 straightline segment if they satisfy some prescribed proximity rule. We consider four classes of higher order proximity graphs, n . . .

ArticleSacristán, VeraLet 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 straightline segment if they satisfy some prescribed proximity rule. We consider four classes of higher order proximity graphs, n . . .

ArticleSilveira, 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 . . .