Complexity of Geometric k-Planarity for Fixed k
From MaRDI portal
Publication:5144878
DOI10.7155/jgaa.00548zbMath1452.05180OpenAlexW3120633265MaRDI QIDQ5144878
Publication date: 19 January 2021
Published in: Journal of Graph Algorithms and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.7155/jgaa.00548
Planar graphs; geometric and topological aspects of graph theory (05C10) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items
The Complexity of Drawing a Graph in a Polygonal Region ⋮ RAC-drawability is \(\exists \mathbb{R} \)-complete ⋮ The Complexity of Angular Resolution ⋮ RAC-Drawability is ∃ℝ-complete and Related Results ⋮ Topological art in simple galleries ⋮ On the Complexity of Some Geometric Problems With Fixed Parameters
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Mnëv's universality theorem revisited
- A Kuratowski-type theorem for planarity of partially embedded graphs
- The graph crossing number and its variants: a survey
- The rectilinear local crossing number of \(K_{n}\)
- An annotated bibliography on 1-planarity
- Algorithms for graphs embeddable with few crossings per edge
- Thickness and coarseness of graphs
- Picking Planar Edges; or, Drawing a Graph with a Planar Subgraph
- On the Pseudolinear Crossing Number
- Complexity of Some Geometric and Topological Problems
- Minimal Obstructions for 1-Immersions and Hardness of 1-Planarity Testing
- Bounds for rectilinear crossing numbers
- Beyond Planar Graphs
- 1-Planarity of Graphs with a Rotation System
- Adding One Edge to Planar Graphs Makes Crossing Number and 1-Planarity Hard
- On the Number of Crossings in a Complete Graph
- Drawing Partially Embedded and Simultaneously Planar Graphs
