On Optimal 2- and 3-Planar Graphs
From MaRDI portal
Publication:4580088
DOI10.4230/LIPIcs.SoCG.2017.16zbMath1435.05057arXiv1703.06526OpenAlexW2600875497MaRDI QIDQ4580088
Michael Kaufmann, Michael A. Bekos, Chrysanthi N. Raftopoulou
Publication date: 13 August 2018
Full work available at URL: https://arxiv.org/abs/1703.06526
Related Items (25)
The density of fan-planar graphs ⋮ Simplifying Non-Simple Fan-Planar Drawings ⋮ Edge-minimum saturated \(k\)-planar drawings ⋮ Simplifying non-simple fan-planar drawings ⋮ Recognizing and embedding simple optimal 2-planar graphs ⋮ Straight-line drawings of 1-planar graphs ⋮ Book embeddings of \(k\)-framed graphs and \(k\)-map graphs ⋮ The family of fan-planar graphs ⋮ The thickness of fan-planar graphs is at most three ⋮ Unnamed Item ⋮ 3D Visibility Representations of 1-planar Graphs ⋮ Turning cliques into paths to achieve planarity ⋮ Simple \(k\)-planar graphs are simple \((k + 1)\)-quasiplanar ⋮ Two-Planar Graphs Are Quasiplanar ⋮ Edge partitions of optimal 2-plane and 3-plane graphs ⋮ On RAC drawings of graphs with one bend per edge ⋮ On RAC drawings of graphs with one bend per edge ⋮ Polyline drawings with topological constraints ⋮ Polyline Drawings with Topological Constraints ⋮ On 3D visibility representations of graphs with few crossings per edge ⋮ Quantitative Restrictions on Crossing Patterns ⋮ Quasi-planar Graphs ⋮ $$\textit{\textbf{k}}$$-Planar Graphs ⋮ Fan-Planar Graphs ⋮ 2-Layer k-Planar Graphs
This page was built for publication: On Optimal 2- and 3-Planar Graphs
