Quasi-planar graphs have a linear number of edges

Combinatorica

Volumn 17, Issue 1, 1997, Pages 1-9

  Agarwal, Pankaj K ^a   Aronov, Boris ^f   Pach, János ^b,c,d   Pollack, Richard ^c   Sharir, Micha ^c,e  

^a Duke University   (United States)

^b CITY UNIVERSITY OF NEW YORK   (United States)

^c NEW YORK UNIVERSITY   (United States)

^d INSTITUTE OF EXPERIMENTAL MEDICINE   (Hungary)

^e TEL AVIV UNIVERSITY   (Israel)

^f POLYTECHNIC UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0031473639     PISSN: 02099683     EISSN: None     Source Type: Journal    
DOI: 10.1007/BF01196127     Document Type: Article

References (7)

1. V. CAPOYLEAS and J. PACH: A Turán-type theorem on chords of a convex polygon, J. Combin. Theory, Ser. B, 56 (1992), 9-15.
2. M. GOLUMBIC: Algorithmic Graph Theory, Academic Press, New York, 1980.
3. A. GYÁRFÁS: On the chromatic number of multiple interval graphs and overlap graphs, Discrete Math., 55 (1985), 161-166.
4. A. GYÁRFÁS and J. LEHEL: Covering and coloring problems for relatives of intervals, Discrete Math., 55 (1985), 167-180.
5. A. V. KOSTOCHKA: On upper bounds for the chromatic number of graphs, in: Modeli i metody optimizacii, Tom 10, Akademiya Nauk SSSR, Sibirskoe Otdelenie, 1988, 204-226.
6. J. PACH and P. K. AGARWAL: Combinatorial Geometry, Wiley-Interscience, New York, 1995.
7. J. PACH, F. SHAROKHI, and M. SZEGEDY: Applications of the crossing number, Proc. 10th Annual ACM Symp. on Computational Geometry (1994), pp. 198-202. Also to appear in Algorithmica.