@inproceedings{825dbf1f593e4ae7a8256c3dc0e581ca,

title = "Quasi-planar graphs have a linear number of edges",

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

author = "Agarwal, {Pankaj K.} and Boris Aronov and J{\'a}nos Pach and Richard Pollack and Micha Sharir",

note = "Publisher Copyright: {\textcopyright} Springer-Verlag Berlin Heidelberg 1996.; Symposium on Graph Drawing, GD 1995 ; Conference date: 20-09-1995 Through 22-09-1995",

year = "1996",

doi = "10.1007/bfb0021784",

language = "אנגלית",

isbn = "3540607234",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "1--7",

editor = "Brandenburg, {Franz J.}",

booktitle = "Graph Drawing - Symposium on Graph Drawing, GD 1995, Proceedings",

}