Crossing numbers

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1763, Issue , 2000, Pages 267-273

  Pach, János ^a  

^a NEW YORK UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY;

CROSSING NUMBER; GRAPH G; LOWER BOUNDS;

COMPUTATIONAL GEOMETRY;

EID: 84947792060     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-46515-7_23     Document Type: Conference Paper

References (29)

1. P. Agarwal, B. Aronov, J. Pach, R. Pollack, and M. Sharir: Quasi-planar graphs have a linear number of edges, Combinatorica 17 (1997), 1–9.
2. M. Ajtai, V. Chvátal, M. Newborn, E. Szemerédi: Crossing-free subgraphs, Annals of Discrete Mathematics 12 (1982), 9–12.
3. D. Bienstock and N. Dean: Bounds for rectilinear crossing numbers, Journal of Graph Theory 17 (1993), 333–348.
4. Ch. Chojnacki A. Hanani: ¨Uber wesentlich unplättbare Kurven im dreidimensionalen Raume, Fund. Math. 23 (1934), 135–142.
5. K. Clarkson, H. Edelsbrunner, L. Guibas, M. Sharir, E. Welzl: Combinatorial complexity bounds for arrangements of curves and surfaces, Discrete and Computational Geometry 5 (1990), 99-160.
6. T. K. Dey: Improved bounds for planar k-sets and related problems, Discrete and Computat. Geometry 19 (1998), 373–382.
7. P. Erdös and R. K. Guy: Crossing number problems, American Mathematical Monthly 80 (1973), 52–58.
8. I. Fáry: On straight line representation of planar graphs, Acta Univ. Szeged. Sect. Sci. Math. 11 (1948), 229–233.
9. M. R. Garey and D. S. Johnson: Crossing number is NP-complete, SIAM Journal of Algebraic and Disccrete Methods 4 (1983), 312–316.
10. R. K. Guy: The decline and fall of Zarankiewicz’s theorem, in: Proof Techniques in Graph Theory, Academic Press, New York, 1969, 63–69.
11. D. J. Kleitman: The crossing number of K5,n, Journal of Combinatorial Theory 9 (1970), 315–323.
12. T. Leighton: Complexity Issues in VLSI, Foundations of Computing Series, MIT Press, Cambridge, MA, 1983.
13. F. T. Leighton: New lower bound techniques for VLSI, Math. Systems Theory 17 (1984), 47–70.
14. R. Lipton and R. Tarjan: A separator theorem for planar graphs, SIAM J. Applied Mathematics 36 (1979), 177–189.
15. J. Pach and P.K. Agarwal: Combinatorial Geometry, J. Wiley and Sons, New York, 1995.
16. J. Pach, F. Shahrokhi, and M. Szegedy: Applications of the crossing number, Algorithmica 16 (1996), 111–117.
17. J. Pach and M. Sharir: On the number of incidences between points and curves, Combinatorics, Probability and Computing 7 (1998), 121–127.
18. J. Pach, J. Spencer, and G. Toth: New bounds on crossing numbers, 15th ACM Symposium on Computational Geometry, 1999, 124–133. Also in: Discrete and Computational Geometry, accepted.
19. J. Pach and G. Toth: Graphs drawn with few crossings per edge, Combinatorica 17 (1997), 427–439.
20. J. Pach and G. Toth: Which crossing number is it, anyway?, in: Proceedings of 39th Annual Symposium on Foundations of Computer Science, Palo Alto, 1998, 617–626.
21. J. Pach and R. Wenger: Embedding planar graphs with fixed vertex locations, in: Graph Drawing’98 (Sue Whitesides, ed.), Lecture Notes in Computer Science, Springer-Verlag, Berlin, 1999, to appear.
22. R. B. Richter and C. Thomassen: Relations between crossing numbers of complete and complete bipartite graphs, American Mathematical Monthly, February 1997, 131–137.
23. L. A. Székely: Crossing numbers and hard Erd˝os problems in discrete geometry, Combinatorics, Probability and Computing 6 (1998), 353–358.
24. J. Spencer, E. Szemerédi, and W. T. Trotter: Unit distances in the Euclidean plane, in: Graph Theory and Combinatorics (B. Bollobás, ed.), Academic Press, New York, 1984, 293–303.
25. E. Szemerédi and W. T. Trotter: Extremal problems in discrete geometry, Combinatorica 3 (1983), 381–392.
26. P. Turán: A note of welcome, Journal of Graph Theory 1 (1977), 7–9.
27. W. T. Tutte: Toward a theory of crossing numbers, Journal of Combinatorial Theory 8 (1970), 45–53.
28. P. Valtr: On geometric graphs with no k pairwise parallel edges, Discrete and Computational Geometry 19 (1998), 461–469.
29. D. R. Woodall: Cyclic-order graphs and Zarankiewicz’s crossing-number conjecture, Journal of Graph Theory 17 (1993), 657–671.