Atomic Embeddability, Clustered Planarity, and Thickenability
From MaRDI portal
Publication:5066950
Recommendations
- Atomic embeddability, clustered planarity, and thickenability
- A new perspective on clustered planarity as a combinatorial embedding problem
- A new perspective on clustered planarity as a combinatorial embedding problem
- A note on obstructions to clustered planarity
- Planarity for clustered graphs
- Bounded Embeddings of Graphs in the Plane
- Combinatorial properties of planar spaces and embeddability
- scientific article; zbMATH DE number 1138195
- scientific article; zbMATH DE number 1500196
- Thickness and outerthickness for embedded graphs
Cites work
- scientific article; zbMATH DE number 412172 (Why is no real title available?)
- scientific article; zbMATH DE number 1974122 (Why is no real title available?)
- scientific article; zbMATH DE number 2103273 (Why is no real title available?)
- scientific article; zbMATH DE number 3259768 (Why is no real title available?)
- A deleted product criterion for approximability of maps by embeddings
- A generalization of Neuwirth's theorem on thickening 2-dimensional polyhedra
- C-Planarity of C-Connected Clustered Graphs
- Clustered Planarity with Pipes
- Clustered planarity testing revisited
- Clustered planarity with pipes
- Counterexample to an extension of the Hanani-Tutte theorem on the surface of genus 4
- Detecting weakly simple polygons
- Efficient Planarity Testing
- Embeddability in \(\mathbb R^3\) is NP-hard
- Finding non-orientable surfaces in 3-manifolds
- Finite extinction time for the solutions to the Ricci flow on certain three-manifolds
- Fully-dynamic planarity testing in polylogarithmic time
- Hanani-Tutte for approximating maps of graphs
- Hierarchical planarity testing algorithms
- Incremental convex planarity testing
- On approximability by embeddings of cycles in the plane.
- On embedding a cycle in a plane graph
- On simplicial maps and chainable continua
- On simultaneous planar graph embeddings
- On-Line Planarity Testing
- Planarity for clustered graphs
- Realization of mappings
- Recognizing Weak Embeddings of Graphs
- Recognizing weakly simple polygons
- Representing homology classes by embedded circles on a compact surface
- Ricci flow and the Poincaré conjecture
- Ricci flow with surgery on three-manifolds
- Shorter Notes: Representing Homology Classes of Closed Orientable Surfaces
- Simultaneous PQ-ordering with applications to constrained embedding problems
- Simultaneous PQ-ordering with applications to constrained embedding problems
- Synchronized planarity with applications to constrained planarity problems
- Testing simultaneous planarity when the common graph is 2-connected
- Testing the simultaneous embeddability of two graphs whose intersection is a biconnected or a connected graph
- The entropy formula for the Ricci flow and its geometric applications
- Topological cycle matroids of infinite graphs
- Toward a theory of planarity: Hanani-Tutte and planarity variants
- Worst-Case Polylog Incremental SPQR-trees: Embeddings, Planarity, and Triconnectivity
Cited in
(9)- Synchronized Planarity with Applications to Constrained Planarity Problems
- On the upward book thickness problem: combinatorial and complexity results
- Hanani-Tutte for radial planarity. II
- Upward and orthogonal planarity are W[1]-hard parameterized by treewidth
- Maintaining triconnected components under node expansion
- Maintaining triconnected components under node expansion
- Drawing Simultaneously Embedded Graphs with Few Bends
- Hanani--Tutte and Hierarchical Partial Planarity
- A note on obstructions to clustered planarity
This page was built for publication: Atomic Embeddability, Clustered Planarity, and Thickenability
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5066950)
