New bounds on the maximum number of edges in k-quasi-planar graphs☆
Under an Elsevier user license
open archive
Keywords
Topological graphs
k-Quasi-planar graphs
Turán-type problems
Cited by (0)
- ☆
A preliminary version of this paper appeared in: Stephen Wismath, Alexander Wolff (Eds.), Graph Drawing, GD 2013, in: Lecture Notes Comput. Sci., vol. 8242, Springer, Berlin, 2013, pp. 95–106.
- 1
Andrew Suk is supported by NSF grant DMS-1500153.
- 2
Bartosz Walczak was supported by Swiss National Science Foundation grant 200020-144531 and by Ministry of Science and Higher Education of Poland grant 884/N-ESF-EuroGIGA/10/2011/0 within ESF EuroGIGA project GraDR.
Copyright © 2015 Elsevier B.V. All rights reserved.