On the maximum number of edges in topologlcal graphs with no four pairwise crossing edges

Proceedings of the Annual Symposium on Computational Geometry

Volumn 2006, Issue , 2006, Pages 259-260

  Ackerman, Eyal ^a  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

Extremal graph theory; Geometric graphs; Pairwise crossing edges; Topological graphs

Indexed keywords

COMPUTATIONAL GEOMETRY; EDGE DETECTION; TOPOLOGY;

EXTREMAL GRAPH THEORY; GEOMETRIC GRAPHS; PAIRWISE CROSSING EDGES; TOPOLOGICAL GRAPHS;

GRAPH THEORY;

EID: 33748066963     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (4)

1. E. ACKERMAN AND G. TARDOS, The maximum number of edges in quasi-planar graphs, manuscript.
2. P. K. AGARWAL, B. ARONOV, J. PACH, R. POLLACK, AND M. SHARIR, Quasi-planar graphs have a linear number of edges, Combinatorial, 17(1):1-9, 1997.
3. J. PACH, R. RADOIČIĆ, AND G. TÓTH, Relaxing planarity for topological graphs, In J. Akiyama and M. Kano, editors, JCDCG, volume 2866 of Lecture Notes in Computer Science, 221-232, Springer, 2002.
4. P. VALTR, Graph drawings with no k pairwise crossing edges, In G. D. Battista, editor, Graph Drawing, volume 1353 of Lecture Notes in Computer Science, 205-218, Springer, 1997.