Crossing stars in topological graphs

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

Volumn 3742 LNCS, Issue , 2005, Pages 184-197

  Tardos, Gábor ^a   Tóth, Géza ^a  

^a INSTITUTE OF EXPERIMENTAL MEDICINE   (Hungary)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL GEOMETRY; COMPUTER SCIENCE; SET THEORY;

CROSSING STARS; SETS;

GRAPH THEORY;

EID: 33646508782     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11589440_19     Document Type: Conference Paper

References (9)

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. 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.
3. J. Pach, R. Radoičić, and G. Tóth, Relaxing planarity for topological graphs, in: Discrete and Computational Geometry (J. Akiyama, M. Kano, eds.), Lecture Notes in Computer Science 2866, Springer-Verlag, Berlin, 2003, 221-232.
4. J. Pach, R. Radoičić, and G. Tóth: A generalization of quasi-planarity in: Towards a Theory of Geometric Graphs, (J. Pach, ed.), Contemporary Mathematics 342, AMS, 2004, 177-183.
5. J. Pach, R. Pinchasi, M. Sharir, and G. Tóth, Topological graphs with no large grids, Graphs and Combinatorics Special Issue dedicated to Victor Neumann-Lara.
6. 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.
7. J. Pach, R. Radoic̊ić, G. Tardos, and G. Tóth, Improving the Crossing Lemma by finding more crossings in sparse graphs, Proceedings of the 20th Annual Symposium on Computational Geometry (SoCG 2004), 2004, 76-85.
8. J. Pach and G. Tóth, Graphs drawn with few crossings per edge, Combinatorica 17 (1997), 427-439.
9. M. Schaefer and D. Stefankovič, Decidability of string graphs, in: Proceedings of the 33rd Annual Symposium on the Theory of Computing (STOC 2001), 2001, 241-246.