Graphs drawn with few crossings per edge

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

Volumn 1190, Issue , 1997, Pages 345-354

  Pach, János ^a   Tóth, Géza ^a  

^a NEW YORK UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DRAWING (GRAPHICS);

CROSSING NUMBER; IMPROVE-A; LOWER BOUNDS;

GRAPH THEORY;

EID: 21444442652     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-62495-3_59     Document Type: Conference Paper

References (9)

1. M. Ajtai, V. Chvátal, M. Newborn, E. Szemerédi, Crossing-free subgraphs, Ann. Discrete Mathematics 12 (1982), 9–12.
2. 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.
3. G. H. Hardy, E. M. Wright, An Introduction to the Theory of Numbers, University Press, Oxford, 1954.
4. T. Leighton, Complexity Issues in VLSI, Foundations of Computing Series, MIT Press, Cambridge, MA, 1983.
5. J. Pach and P.K. Agarwal, Combinatorial Geometry, John Wiley, New York, 1995.
6. J. Pach and M. Sharir, On the number of incidences between points and curves, Combinatorics, Probability, and Computing, submitted.
7. J. Spencer, personal communication.
8. L. Székely, Crossing numbers and hard Erdős problems in discrete geometry, Combinatorics, Probability, and Computing, to appear.
9. E. Szemerédi and W. T. Trotter, Extremal problems in discrete geometry, Combinatorica 3 (1983), 381-392.