Towards the Hanani-Tutte Theorem for Clustered Graphs
From MaRDI portal
Publication:2945188
DOI10.1007/978-3-319-12340-0_15zbMath1417.05038arXiv1410.3022OpenAlexW2963779315MaRDI QIDQ2945188
Publication date: 9 September 2015
Published in: Graph-Theoretic Concepts in Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1410.3022
Related Items (6)
Clustered planarity with pipes ⋮ Clustered planarity testing revisited ⋮ \(c\)-planarity of embedded cyclic \(c\)-graphs ⋮ Stability of intersections of graphs in the plane and the van Kampen obstruction ⋮ Strip planarity testing for embedded planar graphs ⋮ Bounded Embeddings of Graphs in the Plane
Cites Work
- Unnamed Item
- Unnamed Item
- Removing even crossings
- Upward drawings of triconnected digraphs.
- Removing even crossings on surfaces
- Which crossing number is it anyway?
- Bounds for generalized thrackles
- Discrete one-forms on meshes and applications to 3D mesh parameterization
- Hanani–Tutte, Monotone Drawings, and Level-Planarity
- Strip Planarity Testing
- Block Additivity of ℤ2-Embeddings
- Clustered Planarity Testing Revisited
- Strong Hanani–Tutte on the Projective Plane
- Towards an implementation of the 3D visibility skeleton
- Über wesentlich unplättbare Kurven im dreidimensionalen Raume
- Toward a Theory of Planarity: Hanani-Tutte and Planarity Variants
- Hanani-Tutte and Related Results
- Clustering Cycles into Cycles of Clusters
- Toward a theory of crossing numbers
- How to draw a planar clustered graph
- Planarity for clustered graphs
This page was built for publication: Towards the Hanani-Tutte Theorem for Clustered Graphs
