Simplifying Non-Simple Fan-Planar Drawings
DOI10.7155/jgaa.00618OpenAlexW3196892319MaRDI QIDQ5886039
Meghana M. Reddy, Felix Schröder, Kristin Knorr, Boris Klemz
Publication date: 30 March 2023
Published in: Journal of Graph Algorithms and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.7155/jgaa.00618
Graph theory (including graph drawing) in computer science (68R10) Planar graphs; geometric and topological aspects of graph theory (05C10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph algorithms (graph-theoretic aspects) (05C85) Graph representations (geometric and intersection representations, etc.) (05C62)
Cites Work
- Unnamed Item
- Drawing graphs with right angle crossings
- On the maximum number of edges in quasi-planar graphs
- Graphs drawn with few crossings per edge
- Quasi-planar graphs have a linear number of edges
- 1-fan-bundle-planar drawings of graphs
- Gap-planar graphs
- Simple \(k\)-planar graphs are simple \((k + 1)\)-quasiplanar
- Simplifying non-simple fan-planar drawings
- On fan-crossing graphs
- Fan-planarity: properties and complexity
- On the recognition of fan-planar and maximal outer-fan-planar graphs
- On the Number of Edges of Fan-Crossing Free Graphs
- Algorithms and Characterizations for 2-Layer Fan-planarity: From Caterpillar to Stegosaurus
- On Optimal 2- and 3-Planar Graphs
- Fan-Planar Graphs
- Beyond Planar Graphs
This page was built for publication: Simplifying Non-Simple Fan-Planar Drawings
