Edge-minimum saturated \(k\)-planar drawings
From MaRDI portal
Publication:2151425
DOI10.1007/978-3-030-92931-2_1OpenAlexW4206584710MaRDI QIDQ2151425
Irene Parada, Steven Chaplick, Jonathan Rollin, Fabian Klute, Torsten Ueckerdt
Publication date: 1 July 2022
Full work available at URL: https://arxiv.org/abs/2012.08631
Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Cites Work
- Unnamed Item
- Unnamed Item
- A linear time algorithm for testing maximal 1-planarity of graphs with a rotation system
- A survey of minimum saturated graphs
- Improving the crossing lemma by finding more crossings in sparse graphs
- Graphs drawn with few crossings per edge
- What we know and what we do not know about Turán numbers
- The graph crossing number and its variants: a survey
- On topological graphs with at most four crossings per edge
- Crossing numbers and combinatorial characterization of monotone drawings of \(K_n\)
- Saturated simple and \(k\)-simple topological graphs
- Improvements on the density of maximal 1‐planar graphs
- On Optimal 2- and 3-Planar Graphs
- Saturated simple and 2-simple topological graphs with few edges
- On the Density of Maximal 1-Planar Graphs
- On the Maximum Number of Crossings in Star-Simple Drawings of $$K_n$$ with No Empty Lens
- A Problem in Graph Theory
This page was built for publication: Edge-minimum saturated \(k\)-planar drawings
