Graph drawing with no k pairwise crossing edges

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

Volumn 1353, Issue , 1997, Pages 205-218

  Valtk, Pavel ^a,b  

^a CHARLES UNIVERSITY   (Czech Republic)

^b RUTGERS UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DRAWING (GRAPHICS);

CROSSING EDGES; GEOMETRIC GRAPHS; GRAPH DRAWING; JORDAN ARCS; MONOTONE CURVES; POINTS IN GENERAL POSITION; STRAIGHT-LINE SEGMENTS; VERTEX SET;

GRAPH THEORY;

EID: 84957354737     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-63938-1_63     Document Type: Conference Paper

References (12)

1. R. Adamec, M. Klazar, and P. Valtr, Generalized Davenport-Schinzel sequences with linear upper bound, Discrete Math. 108 (1992), 219-229.
2. P.K. Agarwal, B. Aronov, J. Pach, R. Pollack, and M. Sharir, Quasi-planar graphs have a linear number of edges, Graph Drawing (Passau, 1995), Lecture Notes in Comput. Sci. 1027 (1995), 1-7.
3. H. Davenport and A. Schinzel, A combinatorial problem connected with differential equations, Amer. J. Math. 87 (1965), 684-694.
4. R. Dilworth, A decomposition theorem for partially ordered sets, Annals of Mathematics 51 (1950), 161-166.
5. P. Erdős and G. Szekeres, A combinatorial problem in geometry, Compositio Math. 2 (1935), 463-470.
6. M. Klazar and P. Valtr, Generalized Davenport-Schinzel sequences, Combinatorica 14 (1994), 463-476.
7. J. Pach, Notes on geometric graph theory, in: Discrete and Computational Geometry: Papers from DIMA CS Special Year, DIMACS Series, Vol. 6, AMS, Providence, RI, 1991, pp. 273-285.
8. J. Pach and P.K. Agarwal, Combinatorial Geometry, Wile, Interscience, New York (1995).
9. J. Pach, F. Sharokhi, and M. Szegedy, Applications of the crossing number, Algorithmica 16 (1996), 111-117.
10. J. Pach and J. Törőcsik, Some geometric applications of Dilworth's theorem, Discrete Comput. Geom. 12 (1994), 1-7.
11. F. P. Ramsey, On a problem of formal logic, Proc. Lond. Math. Soe., II. Set., 30 (1930), 264-286.
12. P. Valtr, On geometric graphs with no k pairwise parallel edges, to appear in Discrete and Computational Geometry