Atomic Embeddability, Clustered Planarity, and Thickenability
From MaRDI portal
Publication:5066950
DOI10.1145/3502264OpenAlexW2965434619WikidataQ130952974 ScholiaQ130952974MaRDI QIDQ5066950FDOQ5066950
Authors: Radoslav Fulek, Csaba D. Tóth 
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
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
- Title not available (Why is that?)
- The entropy formula for the Ricci flow and its geometric applications
- Ricci flow with surgery on three-manifolds
- Finite extinction time for the solutions to the Ricci flow on certain three-manifolds
- Efficient Planarity Testing
- Ricci flow and the Poincaré conjecture
- Detecting weakly simple polygons
- On-Line Planarity Testing
- Simultaneous PQ-ordering with applications to constrained embedding problems
- On simultaneous planar graph embeddings
- Topological cycle matroids of infinite graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Testing the simultaneous embeddability of two graphs whose intersection is a biconnected or a connected graph
- Hanani-Tutte for approximating maps of graphs
- Hierarchical planarity testing algorithms
- Incremental convex planarity testing
- On embedding a cycle in a plane graph
- Toward a theory of planarity: Hanani-Tutte and planarity variants
- Planarity for clustered graphs
- A generalization of Neuwirth's theorem on thickening 2-dimensional polyhedra
- On simplicial maps and chainable continua
- Embeddability in \(\mathbb R^3\) is NP-hard
- Title not available (Why is that?)
- C-Planarity of C-Connected Clustered Graphs
- Simultaneous PQ-ordering with applications to constrained embedding problems
- A deleted product criterion for approximability of maps by embeddings
- Realization of mappings
- Clustered planarity testing revisited
- Testing simultaneous planarity when the common graph is 2-connected
- On approximability by embeddings of cycles in the plane.
- Recognizing weakly simple polygons
- Shorter Notes: Representing Homology Classes of Closed Orientable Surfaces
- Representing homology classes by embedded circles on a compact surface
- Finding non-orientable surfaces in 3-manifolds
- Clustered Planarity with Pipes
- Clustered planarity with pipes
- Fully-dynamic planarity testing in polylogarithmic time
- Counterexample to an extension of the Hanani-Tutte theorem on the surface of genus 4
- Recognizing Weak Embeddings of Graphs
- Synchronized planarity with applications to constrained planarity problems
- Worst-Case Polylog Incremental SPQR-trees: Embeddings, Planarity, and Triconnectivity
Cited In (9)
- Hanani--Tutte and Hierarchical Partial Planarity
- Maintaining triconnected components under node expansion
- On the upward book thickness problem: combinatorial and complexity results
- Maintaining triconnected components under node expansion
- Upward and orthogonal planarity are W[1]-hard parameterized by treewidth
- Synchronized Planarity with Applications to Constrained Planarity Problems
- A note on obstructions to clustered planarity
- Hanani-Tutte for radial planarity. II
- Drawing Simultaneously Embedded Graphs with Few Bends
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)
