Beyond Planar Graphs
From MaRDI portal
Publication:5126240
DOI10.1007/978-981-15-6533-5zbMath1465.68020OpenAlexW4252436716MaRDI QIDQ5126240
No author found.
Publication date: 15 October 2020
Full work available at URL: https://doi.org/10.1007/978-981-15-6533-5
Proceedings of conferences of miscellaneous specific interest (00B25) Graph theory (including graph drawing) in computer science (68R10) Proceedings, conferences, collections, etc. pertaining to computer science (68-06)
Related Items (13)
Simplifying Non-Simple Fan-Planar Drawings ⋮ Fan-crossing free graphs and their relationship to other beyond-planar graphs ⋮ \((k,p)\)-planarity: a relaxation of hybrid planarity ⋮ On morphing 1-planar drawings ⋮ On the complexity of the storyplan problem ⋮ The family of fan-planar graphs ⋮ On the complexity of the storyplan problem ⋮ Unnamed Item ⋮ Complexity of Geometric k-Planarity for Fixed k ⋮ Re-embedding a 1-plane graph for a straight-line drawing in linear time ⋮ Crossing numbers of beyond-planar graphs ⋮ 1-planarity testing and embedding: an experimental study ⋮ Counting cliques in 1-planar graphs
This page was built for publication: Beyond Planar Graphs
