On the complexity of simultaneous geometric embedding for edge-disjoint graphs

DOI10.1007/978-3-031-75409-8_28MaRDI QIDQ6988702zbMATH OpenFDO

Authors Benedikt Künzel, Jonathan Rollin

Publication date 2 May 2025

Full work available at URL https://doi.org/10.1007/978-3-031-75409-8_28

zbMATH Keywords

existential theory of the realspartial order type realizabilitysimultaneous geometric embedding

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Cites work

• A logarithmic bound for simultaneous embeddings of planar graphs
• Atomic Embeddability, Clustered Planarity, and Thickenability
• Axioms and hulls
• Complexity of some geometric and topological problems
• Embedding Graphs Simultaneously with Fixed Edges
• Embedding planar graphs at fixed vertex locations
• Geometric thickness of multigraphs is \(\exists \mathbb{R} \)-complete
• scientific article; zbMATH DE number 4092241 (Why is no real title available?)
• scientific article; zbMATH DE number 2107521 (Why is no real title available?)
• Intersection graphs of segments
• On a tree and a path with no geometric simultaneous embedding
• On simultaneous planar graph embeddings
• On the complexity of some geometric problems with fixed parameters
• Parameterized complexity of simultaneous planarity
• Simple realizability of complete abstract topological graphs in P
• Simultaneous Embedding
• Simultaneous Graph Embeddings with Fixed Edges
• Synchronized Planarity with Applications to Constrained Planarity Problems
• The Art Gallery Problem is ∃ℝ-complete
• The complexity of simultaneous geometric graph embedding
• Thickness and colorability of geometric graphs

This page was built for publication: On the complexity of simultaneous geometric embedding for edge-disjoint graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6988702)