449 search results - page 6 / 90 » Degenerate crossing numbers |
GD
2007
Springer
15 years 7 months ago
2007
Springer
We show that computing the crossing number of a graph with a given rotation system is NP-complete. This result leads to a new and much simpler proof of Hlinˇen´y’s result, tha...
98
Voted
COMPGEOM
2006
ACM
15 years 6 months ago
2006
ACM
A topological graph is called k-quasi-planar, if it does not contain k pairwise crossing edges. It is conjectured that for every fixed k, the maximum number of edges in a kquasi-...
ESA
2008
Springer
15 years 2 months ago
2008
Springer
We consider a planning problem that generalizes Alcuin's river crossing problem (also known as: The wolf, goat, and cabbage puzzle) to scenarios with arbitrary conflict graph...
107
click to vote
JGT
2010
14 years 11 months ago
2010
The crossing number, cr(G), of a graph G is the least number of crossing points in any drawing of G in the plane. According to the Crossing Lemma of Ajtai, Chv´atal, Newborn, Sze...
79
Voted
GD
2009
Springer
15 years 5 months ago
2009
Springer
We show that cr(G) ≤ 2 iocr(G) 2 settling an open problem of Pach and T´oth [4, 1]. Moreover, iocr(G) = cr(G) if iocr(G) ≤ 2. 1 Crossing Numbers Pach and T´oth point out in ...