Crossing Numbers of Beyond-Planar Graphs Revisited
From MaRDI portal
Publication:5084712
DOI10.7155/jgaa.00586zbMath1489.05035arXiv2105.12452OpenAlexW3165297189MaRDI QIDQ5084712
Nathan van Beusekom, Bettina Speckmann, Irene Parada
Publication date: 28 June 2022
Published in: Journal of Graph Algorithms and Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2105.12452
Graph theory (including graph drawing) in computer science (68R10) Planar graphs; geometric and topological aspects of graph theory (05C10) Graph representations (geometric and intersection representations, etc.) (05C62)
Cites Work
- Drawing graphs with right angle crossings
- Some provably hard crossing number problems
- Gap-planar graphs
- Testing gap \(k\)-planarity is NP-complete
- On topological graphs with at most four crossings per edge
- Approximating the rectilinear crossing number
- Topological graphs with no large grids
- On the Number of Edges of Fan-Crossing Free Graphs
- Are Crossings Important for Drawing Large Graphs?
- Crossing Number is NP-Complete
- Complexity of Some Geometric and Topological Problems
- Rectilinear drawings of graphs
- New results on rectilinear crossing numbers and plane embeddings
- Bounds for rectilinear crossing numbers
- Crossing Numbers of Graphs
- On the size of planarly connected crossing graphs
- Crossing numbers of beyond-planar graphs
- Book embeddings and crossing numbers
This page was built for publication: Crossing Numbers of Beyond-Planar Graphs Revisited
