The density of fan-planar graphs
From MaRDI portal
Publication:2121760
DOI10.37236/10521zbMath1486.05166arXiv1403.6184OpenAlexW4213452989MaRDI QIDQ2121760
Publication date: 4 April 2022
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1403.6184
Graph theory (including graph drawing) in computer science (68R10) Planar graphs; geometric and topological aspects of graph theory (05C10) Graph representations (geometric and intersection representations, etc.) (05C62) Density (toughness, etc.) (05C42)
Related Items (8)
On the recognition of fan-planar and maximal outer-fan-planar graphs ⋮ The family of fan-planar graphs ⋮ Shallow Minors, Graph Products, and Beyond-Planar Graphs ⋮ The thickness of fan-planar graphs is at most three ⋮ 1-fan-bundle-planar drawings of graphs ⋮ Unnamed Item ⋮ Gap-Planar Graphs ⋮ On RAC drawings of graphs with one bend per edge
Cites Work
- A linear time algorithm for testing maximal 1-planarity of graphs with a rotation system
- 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
- On the maximum number of edges in topological graphs with no four pairwise crossing edges
- Graphs drawn with few crossings per edge
- Quasi-planar graphs have a linear number of edges
- On some structural properties of fullerene graphs
- 1-fan-bundle-planar drawings of graphs
- A linear-time algorithm for testing full outer-2-planarity
- Density of straight-line 1-planar graph drawings
- Right angle crossing graphs and 1-planarity
- Simplifying non-simple fan-planar drawings
- On fan-crossing graphs
- On grids in topological graphs
- Fan-planarity: properties and complexity
- Ein Sechsfarbenproblem auf der Kugel
- On the recognition of fan-planar and maximal outer-fan-planar graphs
- Algorithms for graphs embeddable with few crossings per edge
- Topological graphs with no large grids
- Straight-Line Grid Drawings of 3-Connected 1-Planar Graphs
- On the Number of Edges of Fan-Crossing Free Graphs
- Fáry’s Theorem for 1-Planar Graphs
- Planar and Quasi Planar Simultaneous Geometric Embedding
- On the Density of Non-simple 3-Planar Graphs
- Algorithms and Characterizations for 2-Layer Fan-planarity: From Caterpillar to Stegosaurus
- Re-embeddings of Maximum 1-Planar Graphs
- Research Problems in Discrete Geometry
- Crossing Stars in Topological Graphs
- Rectilinear drawings of graphs
- Improvements on the density of maximal 1‐planar graphs
- On Optimal 2- and 3-Planar Graphs
- On the size of planarly connected crossing graphs
- Geometric RAC Simultaneous Drawings of Graphs
- On the Density of Maximal 1-Planar Graphs
- Fan-Planar Graphs
- The Number of Edges in $k$-Quasi-planar Graphs
- How to Draw a Graph
- On Aligned Bar 1-Visibility Graphs
- Crossing numbers of beyond-planar graphs
This page was built for publication: The density of fan-planar graphs
