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

Relaxing Planarity for Topological Graphs

Published:2006 Issue: Volume: Page:285-300
ISSN:1217-4696
Container-title:Bolyai Society Mathematical Studies
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-32439-3_12.pdf

Reference35 articles.

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. Erdős, Disjoint edges in geometric graphs, Discrete Comput. Geom., 4 (1989), 287–290.

4. Bollobás and A. Thomason, Proof of a conjecture of Mader, Erdős 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.

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

1. Quantitative Restrictions on Crossing Patterns;Beyond Planar Graphs;2020

2. Coloring Curves that Cross a Fixed Curve;Discrete & Computational Geometry;2018-10-01

3. On-Line Approach to Off-Line Coloring Problems on Graphs with Geometric Representations;Combinatorica;2016-12-22

4. On the Size of Planarly Connected Crossing Graphs;Lecture Notes in Computer Science;2016

5. Outerstring graphs are χ-bounded;Proceedings of the thirtieth annual symposium on Computational geometry;2014-06-08