Atomic Embeddability, Clustered Planarity, and Thickenability
From MaRDI portal
Publication:5066950
DOI10.1145/3502264OpenAlexW2965434619MaRDI QIDQ5066950
Publication date: 31 March 2022
Published in: Journal of the ACM (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/10150/643333
Related Items (6)
Hanani--Tutte and Hierarchical Partial Planarity ⋮ Maintaining triconnected components under node expansion ⋮ Synchronized Planarity with Applications to Constrained Planarity Problems ⋮ Hanani-Tutte for radial planarity. II ⋮ Drawing Simultaneously Embedded Graphs with Few Bends ⋮ On the upward book thickness problem: combinatorial and complexity results
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Topological cycle matroids of infinite graphs
- Testing the simultaneous embeddability of two graphs whose intersection is a biconnected or a connected graph
- On simultaneous planar graph embeddings
- Clustered planarity testing revisited
- On embedding a cycle in a plane graph
- Representing homology classes by embedded circles on a compact surface
- A deleted product criterion for approximability of maps by embeddings
- On simplicial maps and chainable continua
- On approximability by embeddings of cycles in the plane.
- Recognizing weakly simple polygons
- Finding non-orientable surfaces in 3-manifolds
- Simultaneous embedding: edge orderings, relative positions, cutvertices
- Incremental convex planarity testing
- A generalization of Neuwirth's theorem on thickening 2-dimensional polyhedra
- Counterexample to an extension of the Hanani-Tutte theorem on the surface of genus 4
- Clustered planarity with pipes
- Toward a Theory of Planarity: Hanani-Tutte and Planarity Variants
- Embeddability in the 3-Sphere Is Decidable
- Efficient Planarity Testing
- Shorter Notes: Representing Homology Classes of Closed Orientable Surfaces
- Embeddability in $\mathbb{R}^3$ is NP-hard
- Clustered Planarity with Pipes
- Hierarchical planarity testing algorithms
- On-Line Planarity Testing
- Testing Simultaneous Planarity when the Common Graph is 2-Connected
- Simultaneous PQ-Ordering with Applications to Constrained Embedding Problems
- Recognizing Weak Embeddings of Graphs
- Hanani-Tutte for approximating maps of graphs
- Fully-dynamic planarity testing in polylogarithmic time
- Worst-Case Polylog Incremental SPQR-trees: Embeddings, Planarity, and Triconnectivity
- C-Planarity of C-Connected Clustered Graphs
- Detecting Weakly Simple Polygons
- Realization of mappings
- Simultaneous PQ-Ordering with Applications to Constrained Embedding Problems
- Planarity for clustered graphs
This page was built for publication: Atomic Embeddability, Clustered Planarity, and Thickenability
