## Quasi-Planar Graphs Have a Linear Number of Edges
Agarwal, Pankaj K. and Aronov, Boris and Pach, János and Pollack, Richard and Sharir, Micha
(1996)
Full text not available from this repository. ## AbstractA 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).
Repository Staff Only: item control page References |