Publisher
Springer Nature Switzerland
Reference37 articles.
1. Ackerman, E.: On topological graphs with at most four crossings per edge. CoRR 1509.01932 (2015). http://arxiv.org/abs/1509.01932
2. Ackerman, E., Tardos, G.: On the maximum number of edges in quasi-planar graphs. J. Comb. Theory Ser. A 114(3), 563–571 (2007). https://doi.org/10.1016/j.jcta.2006.08.002
3. Agarwal, P.K., Aronov, B., Pach, J., Pollack, R., Sharir, M.: Quasi-planar graphs have a linear number of edges. Combinatorica 17(1), 1–9 (1997). http://dx.doi.org/10.1007/BF01196127
4. Lecture Notes in Computer Science;MJ Alam,2013
5. Angelini, P., et al.: Simple k-planar graphs are simple (k+1)-quasiplanar. J. Comb. Theory Ser. B 142, 1–35 (2020). https://doi.org/10.1016/j.jctb.2019.08.006