124 search results - page 7 / 25 » Crossing Number of Toroidal Graphs |
96
Voted
CORR
2010
Springer
15 years 1 months ago
2010
Springer
95
Voted
GD
2007
Springer
15 years 10 months ago
2007
Springer
We prove that the crossing number of a graph decays in a “continuous fashion” in the following sense. For any ε > 0 there is a δ > 0 such that for n sufficiently large...
133
click to vote
ARSCOM
2002
15 years 4 months ago
2002
Given a non-planar graph G with a subdivision of K5 as a subgraph, we can either transform the K5-subdivision into a K3,3-subdivision if it is possible, or else we obtain a partit...
129
click to vote
GD
2006
Springer
15 years 8 months ago
2006
Springer
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...
116
click to vote
GD
2009
Springer
15 years 9 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 ...