Sciweavers

396 search results - page 6 / 80
» Odd Crossing Number Is Not Crossing Number
Sort
View
GD
2006
Springer
15 years 1 months ago
On the Decay of Crossing Numbers
The crossing number cr(G) of a graph G is the minimum number of crossings over all drawings of G in the plane. In 1993, Richter and Thomassen [RT93] conjectured that there is a co...
Jacob Fox, Csaba D. Tóth
COMPGEOM
2010
ACM
15 years 2 months ago
Adding one edge to planar graphs makes crossing number hard
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 ...
Sergio Cabello, Bojan Mohar
COMPGEOM
2005
ACM
14 years 11 months ago
Abstract order type extension and new results on the rectilinear crossing number
Order Type Extension and New Results ectilinear Crossing Number - Extended Abstract Oswin Aichholzer∗ Hannes Krasser† We provide a complete data base of all realizable order t...
Oswin Aichholzer, Hannes Krasser
COMGEO
2011
ACM
14 years 4 months ago
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 straight-line segment if they satisfy some prescribed prox...
Bernardo M. Ábrego, Ruy Fabila Monroy, Silv...
ENDM
2008
101views more  ENDM 2008»
14 years 9 months ago
A central approach to bound the number of crossings in a generalized configuration
A generalized configuration is a set of n points and n 2 pseudolines such that each pseudoline passes through exactly two points, two pseudolines intersect exactly once, and no th...
Bernardo M. Ábrego, Silvia Fernández...