131 search results - page 7 / 27 » Crossing Number and Weighted Crossing Number of Near-Planar ... |
IJFCS
2006
13 years 6 months ago
2006
ENDM
2007
13 years 6 months ago
2007
CORR
2010
Springer
13 years 4 months ago
2010
Springer
GD
2009
Springer
13 years 11 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 ...
GD
2006
Springer
13 years 10 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...