The Number of Edges in k-Quasi-planar Graphs
A graph drawn in the plane is called k-quasi-planar if it does not contain k pairwise crossing edges. It has been conjectured for a long time that for every fixed k, the maximum number of edges of a k-quasi-planar graph with n vertices is O(n). The best known upper bound is n(log n)[superscript O(lo...
| Autors principals: | , , |
|---|---|
| Altres autors: | |
| Format: | Article |
| Idioma: | en_US |
| Publicat: |
Society for Industrial and Applied Mathematics
2013
|
| Accés en línia: | http://hdl.handle.net/1721.1/79615 |