Quasi-planar graphs have a linear number of edges

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

Volumn 1027, Issue , 1996, Pages 1-7

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

^a Duke University   (United States)

^b POLYTECHNIC UNIVERSITY   (United States)

^c CITY UNIVERSITY OF NEW YORK   (United States)

^d NEW YORK UNIVERSITY   (United States)

^e INSTITUTE OF EXPERIMENTAL MEDICINE   (Hungary)

^f TEL AVIV UNIVERSITY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

DRAWING (GRAPHICS);

PLANAR GRAPH;

GRAPH THEORY;

EID: 84947903127     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/bfb0021784     Document Type: Conference Paper

References (6)

1. M. Golumbic, Algorithmic Graph Theory, Academic Press, New York, 1980.
2. A. Gyárfás, On the chromatic number of multiple interval graphs and overlap graphs, Discrete Math. 55 (1985), 161-166.
3. A. Gyárfás and J. Lehel, Covering and coloring problems for relatives of intervals, Discrete Math. 55 (1985), 167-180.
4. 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.
5. J. Pach and P.K. Agarwal, Combinatorial Geometry, Wiley-Interscience, New York, 1995.
6. 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.