Publisher
Springer International Publishing
Reference28 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. Auer, C., et al.: Outer 1-planar graphs. Algorithmica 74(4), 1293–1320 (2016). https://doi.org/10.1007/s00453-015-0002-1
3. Lecture Notes in Computer Science;MA Bekos,2015
4. Bekos, M.A., Giacomo, E.D., Didimo, W., Liotta, G., Montecchiani, F., Raftopoulou, C.N.: Edge partitions of optimal 2-plane and 3-plane graphs. Discret. Math. 342(4), 1038–1047 (2019). https://doi.org/10.1016/j.disc.2018.12.002
5. Bekos, M.A., Kaufmann, M., Raftopoulou, C.N.: On optimal 2- and 3-planar graphs. In: Aronov, B., Katz, M.J. (eds.) 33rd International Symposium on Computational Geometry, SoCG 2017, 4–7 July 2017, Brisbane, Australia. LIPIcs, vol. 77, pp. 16:1–16:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2017). https://doi.org/10.4230/LIPIcs.SoCG.2017.16
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Min-k-planar Drawings of Graphs;Lecture Notes in Computer Science;2023
2. The Family of Fan-Planar Graphs;WALCOM: Algorithms and Computation;2023