Subject
General Computer Science,Theoretical Computer Science
Reference37 articles.
1. Quasi-planar graphs have a linear number of edges;Agarwal;Combinatorica,1997
2. The straight-line RAC drawing problem is NP-hard;Argyriou;J. Graph Algorithms Appl.,2012
3. Outer 1-planar graphs;Auer;Algorithmica,2016
4. On sparse maximal 2-planar graphs;Auer,2012
5. Gap-planar graphs;Bae,2017
Cited by
9 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Shallow Minors, Graph Products, and Beyond-Planar Graphs;SIAM Journal on Discrete Mathematics;2024-03-13
2. k-Planar Placement and Packing of Δ-Regular Caterpillars;International Journal of Foundations of Computer Science;2023-05-22
3. The Family of Fan-Planar Graphs;WALCOM: Algorithms and Computation;2023
4. The Density of Fan-Planar Graphs;The Electronic Journal of Combinatorics;2022-02-11
5. Simplifying Non-simple Fan-Planar Drawings;Lecture Notes in Computer Science;2021