Results 1  10
of
16
Graphs that Admit Right Angle Crossing Drawings
"... We consider right angle crossing (RAC) drawings of graphs in which the edges are represented by polygonal arcs and any two edges can cross only at a right angle. We show that if a graph with n vertices admits a RAC drawing with at most 1 bend or 2 bends per edge, then the number of edges is at most ..."
Abstract

Cited by 6 (1 self)
 Add to MetaCart
We consider right angle crossing (RAC) drawings of graphs in which the edges are represented by polygonal arcs and any two edges can cross only at a right angle. We show that if a graph with n vertices admits a RAC drawing with at most 1 bend or 2 bends per edge, then the number of edges is at most 6.5n and 74.2n, respectively. This is a strengthening of a recent result of Didimo et al.
On Crossing Numbers of Geometric Proximity Graphs
"... 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 straightline segment if they satisfy some prescribed proximity rule. We consider four classes of higher order proximity graphs, namely, the knearest neighbor graph, the krelati ..."
Abstract

Cited by 3 (2 self)
 Add to MetaCart
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 straightline segment if they satisfy some prescribed proximity rule. We consider four classes of higher order proximity graphs, namely, the knearest neighbor graph, the krelative neighborhood graph, the kGabriel graph and the kDelaunay graph. For k = 0 (k = 1 in the case of the knearest neighbor graph) these graphs are plane, but for higher values of k in general they contain crossings. In this paper we provide lower and upper bounds on their minimum and maximum number of crossings. We give general bounds and we also study particular cases that are especially interesting from the viewpoint of applications. These cases include the 1Delaunay graph and the knearest neighbor graph for small values of k.
A Bipartite Strengthening of the Crossing Lemma
"... Abstract. The celebrated Crossing Lemma states that, in every drawing of a graph with n vertices and m ≥ 4n edges there are at least Ω(m 3 /n 2) pairs of crossing edges; or equivalently, there is an edge that crosses Ω(m 2 /n 2) other edges. We strengthen the Crossing Lemma for drawings in which any ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
Abstract. The celebrated Crossing Lemma states that, in every drawing of a graph with n vertices and m ≥ 4n edges there are at least Ω(m 3 /n 2) pairs of crossing edges; or equivalently, there is an edge that crosses Ω(m 2 /n 2) other edges. We strengthen the Crossing Lemma for drawings in which any two edges cross in at most O(1) points. We prove for every k ∈ N that every graph G with n vertices and m ≥ 3n edges drawn in the plane such that any two edges intersect in at most k points has two disjoint subsets of edges, E1 and E2, each of size at least ckm 2 /n 2, such that every edge in E1 crosses all edges in E2, where ck> 0 only depends on k. This bound is best possible up to the constant ck for every k ∈ N. We also prove that every graph G with n vertices and m ≥ 3n edges drawn in the plane with xmonotone edges has disjoint subsets of edges, E1 and E2, each of size Ω(m 2 /(n 2 polylog n)), such that every edge in E1 crosses all edges in E2. On the other hand, we construct xmonotone drawings of bipartite dense graphs where the largest such subsets E1 and E2 have size O(m 2 /(n 2 log(m/n))). 1
On Crossings in Geometric Proximity Graphs
"... We study the number of crossings among edges of some higher order proximity graphs of the family of the Delaunay graph. That is, given a set P of n points in the Euclidean plane, we give lower and upper bounds on the minimum and the maximum number of crossings that these geometric graphs defined on ..."
Abstract
 Add to MetaCart
We study the number of crossings among edges of some higher order proximity graphs of the family of the Delaunay graph. That is, given a set P of n points in the Euclidean plane, we give lower and upper bounds on the minimum and the maximum number of crossings that these geometric graphs defined on P have. 1
Towards the Albertson conjecture
"... Albertson conjectured that if a graph G has chromatic number r, then the crossing number of G is at least as large as the crossing number of Kr, the complete graph on r vertices. Albertson, Cranston, and Fox verified the conjecture for r � 12. In this paper we prove it for r � 16. Dedicated to the m ..."
Abstract
 Add to MetaCart
Albertson conjectured that if a graph G has chromatic number r, then the crossing number of G is at least as large as the crossing number of Kr, the complete graph on r vertices. Albertson, Cranston, and Fox verified the conjecture for r � 12. In this paper we prove it for r � 16. Dedicated to the memory of Michael O. Albertson. 1