Beyond Planar Graphs: Introduction
From MaRDI portal
Publication:5001653
DOI10.1007/978-981-15-6533-5_1zbMath1473.05070OpenAlexW3089575766MaRDI QIDQ5001653
Publication date: 22 July 2021
Published in: Beyond Planar Graphs (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-981-15-6533-5_1
Analysis of algorithms and problem complexity (68Q25) Planar graphs; geometric and topological aspects of graph theory (05C10) Graph representations (geometric and intersection representations, etc.) (05C62)
Related Items (4)
Simplifying non-simple fan-planar drawings ⋮ Optimal-area visibility representations of outer-1-plane graphs ⋮ On the edge-connectivity and restricted edge-connectivity of optimal 1-planar graphs ⋮ The thickness of fan-planar graphs is at most three
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Outer 1-planar graphs
- Circular right-angle crossing drawings in linear time
- A linear time algorithm for testing maximal 1-planarity of graphs with a rotation system
- 2-layer right angle crossing drawings
- A linear-time algorithm for testing outer-1-planarity
- Drawing graphs with right angle crossings
- The structure of 1-planar graphs
- On the maximum number of edges in topological graphs with no four pairwise crossing edges
- Optimal 1-planar graphs which triangulate other surfaces
- Graphs drawn with few crossings per edge
- Quasi-planar graphs have a linear number of edges
- Recognizing optimal 1-planar graphs in linear time
- A linear-time algorithm for testing full outer-2-planarity
- Gap-planar graphs
- Right angle crossing graphs and 1-planarity
- Simple \(k\)-planar graphs are simple \((k + 1)\)-quasiplanar
- Embedding-preserving rectangle visibility representations of nonplanar graphs
- Polyline drawings with topological constraints
- Fan-planarity: properties and complexity
- 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
- On properties of maximal 1-planar graphs
- On the Number of Edges of Fan-Crossing Free Graphs
- Fáry’s Theorem for 1-Planar Graphs
- Re-embedding a 1-Plane Graph into a Straight-Line Drawing in Linear Time
- The Straight-Line RAC Drawing Problem is NP-Hard
- Straight-Line Drawability of a Planar Graph Plus an Edge
- Minimal Obstructions for 1-Immersions and Hardness of 1-Planarity Testing
- Rectilinear drawings of graphs
- Parameterized Complexity of 1-Planarity
- Beyond Outerplanarity
- 1-Planarity of Graphs with a Rotation System
- The Number of Edges in $k$-Quasi-planar Graphs
- Adding One Edge to Planar Graphs Makes Crossing Number and 1-Planarity Hard
This page was built for publication: Beyond Planar Graphs: Introduction
