Relaxing planarity for topological graphs

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

Volumn 2866, Issue , 2003, Pages 221-232

  Pach, János ^a   Radoičić, Radoš ^b   Tóth, Géza ^c  

^a NEW YORK UNIVERSITY   (United States)

^b MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^c INSTITUTE OF EXPERIMENTAL MEDICINE   (Hungary)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL GEOMETRY; TOPOLOGY;

CROSSING EDGES; PLANAR GRAPH; PLANARITY; STRAIGHT-LINE DRAWINGS; TOPOLOGICAL GRAPHS;

GRAPH THEORY;

EID: 35248876314     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-44400-8_24     Document Type: Article

References (35)

1. P. K. 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, and E. Szemerédi, Crossing-free subgraphs, in: Theory and Practice of Combinatorics, North-Holland Math. Stud. 60, North-Holland, Amsterdam-New York, 1982, 9-12.
3. N. Alon and P. Erdos, Disjoint edges in geometric graphs, Discrete Comput. Geom. 4 (1989), 287-290.
4. Bollobás and A. Thomason, Proof of a conjecture of Mader, Erdos and Hajnal on topological complete subgraphs, European J. Combin. 19 (1998), 883-887.
5. P. Braß, G. Károlyi, and P. Valtr, A Turán-type extremal theory for convex geometric graphs, in: Discrete and Computational Geometry - The Goodman-Pollack Festschrift (B. Aronov et al., eds.), Springer Verlag, Berlin, 2003, to appear.
6. G. Cairns and Y. Nikolayevsky, Bounds for generalized thrackles, Discrete Comput. Geom. 23 (2000), 191-206.
7. V. Capoyleas and J. Pach, A Turán-type theorem on chords of a convex polygon, Journal of Combinatorial Theory, Series B 56 (1992), 9-15.
8. W. Goddard, M. Katchalski, and D. J. Kleitman, Forcing disjoint segments in the plane, European J. Combin. 17 (1996), 391-395.
9. H. Hopf and E. Pannwitz, Aufgabe Nr. 167, Jahresbericht der deutschen Mathematiker-Vereinigung 43 (1934), 114.
10. P. Kolman and J. Matoušek, Crossing number, pair-crossing number, and expansion, manuscript.
11. J. Komlós and E. Szemerédi, Topological cliques in graphs II, Combin. Probab. Comput. 5 (1996), 79-90.
12. A. V. Kostochka, Lower bound of the Hadwiger number of graphs by their average degree, Combinatorica 4 (1984), 307-316.
13. A. V. Kostochka, Upper bounds on the chromatic number of graphs (in Russian), Trudy Inst. Mat. (Novosibirsk), Modeli i Metody Optim., 10 (1988), 204-226.
14. A. V. Kostochka and J. Kratochvíl, Covering and coloring polygon-circle graphs, Discrete Math. 163 (1997), 299-305.
15. F. T. Leighton, New lower bound techniques for VLSI, Math. Systems Theory 17 (1984), 47-70.
16. L. Lovász, J. Pach, and M. Szegedy, On Conway's thrackle conjecture, Discrete and Computational Geometry, 18 (1997), 369-376.
17. 5, Combinatorica 18 (1998), 569-595.
18. S. McGuinness, Colouring arcwise connected sets in the plane I, Graphs & Combin. 16 (2000), 429-439.
19. J. Pach, Geometric graph theory, in: Surveys in Combinatorics, 1999 (J. D. Lamb and D. A. Preece, eds.), London Mathematical Society Lecture Notes 267, Cambridge University Press, Cambridge, 1999, 167-200.
20. J. Pach, R. Pinchasi, M. Sharir, and G. Tóth, Topological graphs with no large grids, to appear.
21. J. Pach, R. Pinchasi, G. Tardos, and G. Tóth, Geometric graphs with no self-intersecting path of length three, in: Graph Drawing (M. T. Goodrich, S. G. Kobourov, eds.), Lecture Notes in Computer Science, 2528, Springer-Verlag, Berlin, 2002, 295-311.
22. J. Pach, R. Radoičić, and G. Tóth, On quasi-planar graphs, in preparation.
23. J. Pach, R. Radoičić, G. Tardos, and G. Tóth, Graphs drawn with at most 3 crossings per edge, to appear.
24. J. Pach, F. Shahrokhi, and M. Szegedy, Applications of the crossing number, Algorithmica 16 (1996), 111-117.
25. J. Pach and G. Tóth, Graphs drawn with few crossings per edge, Combinatorica 17 (1997), 427-439.
26. J. Pach and J. Törocsik, Some geometric applications of Dilworth's theorem, Discrete Comput. Geom. 12 (1994), 1-7.
27. R. Pinchasi and R. Radoičić, On the number of edges in geometric graphs with no self-intersecting cycle of length 4, to appear.
28. 6-free graphs, Combinatorica 13 (1993), 279-361.
29. O. Sýkora and I. Vrt́o, On VLSI layouts of the star graph and related networks, Integration, The VLSI Journal 17 (1994), 83-93.
30. G. Tardos, On the number of edges in a geometric graph with no short self-intersecting paths, in preparation.
31. A. Thomason, An extremal function for contractions of graphs, Math. Proc. Cambridge Philos. Soc. 95 (1984), 261-265.
32. G. Tóth, Note on geometric graphs, J. Combin. Theory, Ser. A 89 (2000), 126-132.
33. A. Thomason, The extremal function for complete minors, J. Combin. Theory Ser. B 81 (2001), 318-338.
34. P. Valtr, On geometric graphs with no k pairwise parallel edges, Discrete and Computational Geometry 19 (1998), 461-469.
35. D. R. Woodall, Thrackles and deadlock, in: Combinatorial Mathematics and its Applications (Proc. Conf., Oxford, 1969), Academic Press, London, 1971, 335-347.