Which crossing number is it anyway?
Journal of Combinatorial Theory Series B
Computing crossing numbers in quadratic time
Journal of Computer and System Sciences - STOC 2001
Proceedings of the twenty-second annual symposium on Computational geometry
Journal of Combinatorial Theory Series B
Algebraic characterizations of outerplanar and planar graphs
European Journal of Combinatorics
Odd Crossing Number and Crossing Number Are Not the Same
Discrete & Computational Geometry
Pfaffian graphs, T-joins and crossing numbers
Combinatorica
Note on the Pair-crossing Number and the Odd-crossing Number
Discrete & Computational Geometry
Removing even crossings on surfaces
European Journal of Combinatorics
Strong Hanani-Tutte on the Projective Plane
SIAM Journal on Discrete Mathematics
Crossing numbers and parameterized complexity
GD'07 Proceedings of the 15th international conference on Graph drawing
Crossing Numbers of Graphs with Rotation Systems
Algorithmica - Special issue: Algorithms, Combinatorics, & Geometry
Hanani-Tutte and monotone drawings
WG'11 Proceedings of the 37th international conference on Graph-Theoretic Concepts in Computer Science
GD'11 Proceedings of the 19th international conference on Graph Drawing
GD'11 Proceedings of the 19th international conference on Graph Drawing
Toward a theory of planarity: hanani-tutte and planarity variants
GD'12 Proceedings of the 20th international conference on Graph Drawing
| Hi-index | 0.00 |
We show that $\mathrm{cr}(G)\leq({2\,\mathrm{iocr}(G)\atop2})$, settling an open problem of Pach and Tóth [Geombinatorics, 9 (2000), pp. 194-207]. Moreover, $\mathrm{iocr}(G)=\mathrm{cr}(G)$ if $\mathrm{iocr}(G)\leq2$.