ISSN:
1439-6912
Keywords:
05 C 35
;
05 C 40
;
68 R 05
Source:
Springer Online Journal Archives 1860-2000
Topics:
Mathematics
Notes:
Abstract A graph is calledquasi-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 withn vertices isO(n).
Type of Medium:
Electronic Resource
URL:
http://dx.doi.org/10.1007/BF01196127
Permalink