2-Layer k-Planar Graphs
From MaRDI portal
Publication:5014133
DOI10.1007/978-3-030-68766-3_32OpenAlexW3133920734MaRDI QIDQ5014133
Patrizio Angelini, Thomas Schneck, Henry Förster, Giordano Da Lozzo
Publication date: 1 December 2021
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-030-68766-3_32
Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Related Items (1)
Cites Work
- Unnamed Item
- Outer 1-planar graphs
- Circular right-angle crossing drawings in linear time
- 2-layer right angle crossing drawings
- A linear-time algorithm for testing outer-1-planarity
- Drawing graphs with right angle crossings
- Improving the crossing lemma by finding more crossings in sparse graphs
- 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 parameterized complexity of layered graph drawing
- On the maximum number of edges in topological graphs with no four pairwise crossing edges
- A Turán-type theorem on chords of a convex polygon
- Graphs drawn with few crossings per edge
- Quasi-planar graphs have a linear number of edges
- On geometric graphs with no \(k\) pairwise parallel edges
- A linear-time algorithm for testing full outer-2-planarity
- Applications of the crossing number
- Density of straight-line 1-planar graph drawings
- Right angle crossing graphs and 1-planarity
- Simple \(k\)-planar graphs are simple \((k + 1)\)-quasiplanar
- On topological graphs with at most four crossings per edge
- Fan-planarity: properties and complexity
- Ein Sechsfarbenproblem auf der Kugel
- On the recognition of fan-planar and maximal outer-fan-planar graphs
- The Crossing-Angle Resolution in Graph Drawing
- On the Density of Non-simple 3-Planar Graphs
- Algorithms and Characterizations for 2-Layer Fan-planarity: From Caterpillar to Stegosaurus
- Coloring k k -free intersection graphs of geometric objects in the plane
- Minimal Obstructions for 1-Immersions and Hardness of 1-Planarity Testing
- Crossing-Free Subgraphs
- Graph Drawing and Applications for Software and Knowledge Engineers
- Proofs from THE BOOK
- On Optimal 2- and 3-Planar Graphs
- Beyond Outerplanarity
- On Layered Fan-Planar Graph Drawings
- The Number of Edges in $k$-Quasi-planar Graphs
- Crossing Number Problems
- Discrete and Computational Geometry
- On RAC drawings of graphs with one bend per edge
This page was built for publication: 2-Layer k-Planar Graphs
