Relaxing Planarity for Topological Graphs-Reference-Cited by-同舟云学术

Relaxing Planarity for Topological Graphs

Published:2003 Issue: Volume: Page:221-232
ISSN:0302-9743
Container-title:Discrete and Computational Geometry
language:
Short-container-title:

Author:

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

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-540-44400-8_24

Reference35 articles.

1. Agarwal, P.K., Aronov, B., Pach, J., Pollack, R., Sharir, M.: Quasi-planar graphs have a linear number of edges. Combinatorica 17, 1–9 (1997)

2. Ajtai, M., Chvátal, V., Newborn, M., Szemerédi, E.: Crossing-free subgraphs. In: Theory and Practice of Combinatorics, North-Holland Math. Stud., vol. 60, pp. 9–12. North-Holland, Amsterdam (1982)

3. Alon, N., Erdös, P.: Disjoint edges in geometric graphs. Discrete Comput. Geom. 4, 287–290 (1989)

4. Bollobás, Thomason, A.: Proof of a conjecture of Mader, Erdös and Hajnal on topological complete subgraphs. European J. Combin. 19, 883–887 (1998)

5. Braß, P., Károlyi, G., Valtr, P.: A Turán-type extremal theory for convex geometric graphs. In: Aronov, B., et al. (eds.) Discrete and Computational Geometry – The Goodman-Pollack Festschrift, Springer, Heidelberg (2003) (to appear)

Cited by 21 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Quasiplanar Graphs, String Graphs, and the Erdős-Gallai Problem;Lecture Notes in Computer Science;2023

2. Twenty Years of Progress of $$\hbox {JCDCG}^3$$;Graphs and Combinatorics;2020-02-01

3. 2-Layer k-Planar Graphs;Lecture Notes in Computer Science;2020

4. Quasi-planar Graphs;Beyond Planar Graphs;2020

5. On the Relationship Between k-Planar and k-Quasi-Planar Graphs;Graph-Theoretic Concepts in Computer Science;2017