Graphs drawn with few crossings per edge

Combinatorica

Volumn 17, Issue 3, 1997, Pages 427-439

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

^a INSTITUTE OF EXPERIMENTAL MEDICINE   (Hungary)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0031455815     PISSN: 02099683     EISSN: None     Source Type: Journal    
DOI: 10.1007/BF01215922     Document Type: Article

References (9)

1. M. AJTAI, V. CHVÁTAL, M. NEWBORN, and E. SZEMERÉDI: Crossing-free subgraphs, Ann. Discrete Mathematics, 12 (1982), 9-12.
2. K. CLARKSON, H. EDELSBRUNNER, L. GUIBAS, M. SHARIR, and E. WELZL: Combinatorial complexity bounds for arrangements of curves and surfaces, Discrete and Computational Geometry, 5 (1990), 99-160.
3. G. H. HARDY and 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. PACK 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, to appear.
7. J. SPENCER: A midrange crossing constant, manuscript, 1997.
8. L. SZÉKELY: Crossing numbers and hard Erdos 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.