Join Our Newsletter

115 search results - page 1 / 23» Geometric graphs with no two parallel edges |

COMBINATORICA

2008

11 years 12 months ago
2008

We give a simple proof for a theorem of Katchalski, Last, and Valtr, asserting that the maximum number of edges in a geometric graph G on n vertices with no pair of parallel edges...

IPL

2008

11 years 11 months ago
2008

Let S be a set of n points in general position in the plane, labelled bijectively with the integers {0, 1, . . ., n - 1}. Each edge (the straight segment that joins two points) is...

COMPGEOM

2010

ACM

12 years 4 months ago
2010

ACM

A graph is near-planar if it can be obtained from a planar graph by adding an edge. We show that it is NP-hard to compute the crossing number of near-planar graphs. The main idea ...

ENDM

2008

11 years 12 months ago
2008

In this paper we study some connectivity augmentation problems. Given a connected graph G with some desirable property, we want to make G 2-vertex connected (or 2-edge connected) ...

DIALM

2008

ACM

12 years 1 months ago
2008

ACM

A random geometric graph G(n, r) is a graph resulting from placing n points uniformly at random on the unit area disk, and connecting two points iff their Euclidean distance is at ...