Part of the Lecture Notes in Computer Science book series (LNCS, volume 1027)
Quasi-planar graphs have a linear number of edges
A graph is called quasi-planar if it can be drawn in the plane so that no three of its edges are pairwise crossing. It is shown that the maximum number of edges of a quasi-planar graph with n vertices is O(n).
KeywordsPlanar Graph Chromatic Number Graph Edge Graph Vertex Combinatorial Geometry
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
- 1.M. Golumbic, Algorithmic Graph Theory, Academic Press, New York, 1980.Google Scholar
- 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.Google Scholar
- 5.J. Pach and P.K. Agarwal, Combinatorial Geometry, Wiley-Interscience, New York, 1995.Google Scholar
- 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.Google Scholar
© Springer-Verlag Berlin Heidelberg 1996