Conference ProceedingsOPEN ACCESS

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) (1996) 1027 1-7
DOI: 10.1007/bfb0021784
12Citations
Citations of this article
10Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

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).

Cite

CITATION STYLE

APA

Agarwal, P. K., Aronov, B., Pach, J., Pollack, R., & Sharir, M. (1996). Quasi-planar graphs have a linear number of edges. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1027, pp. 1–7). Springer Verlag. https://doi.org/10.1007/bfb0021784

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free