The family of fan-planar graphs
From MaRDI portal
Publication:6091140
DOI10.1007/978-3-031-27051-2_2MaRDI QIDQ6091140
No author found.
Publication date: 24 November 2023
Published in: WALCOM: Algorithms and Computation (Search for Journal in Brave)
Cites Work
- Outer 1-planar graphs
- Drawing graphs with right angle crossings
- On the maximum number of edges in quasi-planar graphs
- New bounds on the maximum number of edges in \(k\)-quasi-planar graphs
- Graphs drawn with few crossings per edge
- Quasi-planar graphs have a linear number of edges
- Recognizing optimal 1-planar graphs in linear time
- 1-fan-bundle-planar drawings of graphs
- Simple \(k\)-planar graphs are simple \((k + 1)\)-quasiplanar
- The density of fan-planar graphs
- Simplifying non-simple fan-planar drawings
- Recognizing and embedding simple optimal 2-planar graphs
- On the queue number of planar graphs
- On topological graphs with at most four crossings per edge
- On fan-crossing graphs
- Fan-planarity: properties and complexity
- Ein Sechsfarbenproblem auf der Kugel
- An annotated bibliography on 1-planarity
- On the recognition of fan-planar and maximal outer-fan-planar graphs
- Algorithms for graphs embeddable with few crossings per edge
- Fan-crossing free graphs and their relationship to other beyond-planar graphs
- Straight-Line Grid Drawings of 3-Connected 1-Planar Graphs
- On the Number of Edges of Fan-Crossing Free Graphs
- Algorithms and Characterizations for 2-Layer Fan-planarity: From Caterpillar to Stegosaurus
- Re-embeddings of Maximum 1-Planar Graphs
- Über 1-optimale Graphen
- k-Quasi-Planar Graphs
- On Optimal 2- and 3-Planar Graphs
- A new proof of the 6 color theorem
- Right Angle Crossing Drawings of Graphs
- On Layered Fan-Planar Graph Drawings
- Beyond Planar Graphs
- The Number of Edges in $k$-Quasi-planar Graphs
- The thickness of fan-planar graphs is at most three
This page was built for publication: The family of fan-planar graphs
