Hanani-Tutte for approximating maps of graphs
From MaRDI portal
Publication:5115807
DOI10.4230/LIPIcs.SoCG.2018.39zbMath1497.57036arXiv1705.05243MaRDI QIDQ5115807
Publication date: 18 August 2020
Full work available at URL: https://arxiv.org/abs/1705.05243
Planar graphs; geometric and topological aspects of graph theory (05C10) Relations of low-dimensional topology with graph theory (57M15) Embeddings and immersions in PL-topology (57Q35)
Related Items (13)
Hanani--Tutte and Hierarchical Partial Planarity ⋮ Atomic Embeddability, Clustered Planarity, and Thickenability ⋮ Clustered planarity with pipes ⋮ Hanani-Tutte for radial planarity. II ⋮ Embedding graphs into embedded graphs ⋮ Clustered planarity = flat clustered planarity ⋮ Crossing minimization in perturbed drawings ⋮ Stability of intersections of graphs in the plane and the van Kampen obstruction ⋮ Crossing minimization in perturbed drawings ⋮ Unnamed Item ⋮ C-planarity testing of embedded clustered graphs with bounded dual carving-width ⋮ Front Matter, Table of Contents, Foreword, Conference Organization, Additional Reviewers, Acknowledgement of Support, Invited Talks ⋮ Beyond Clustered Planar Graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Strip planarity testing for embedded planar graphs
- Removing even crossings
- On embedding a cycle in a plane graph
- A deleted product criterion for approximability of maps by embeddings
- On approximability by embeddings of cycles in the plane.
- Unified Hanani-Tutte theorem
- Toward a Theory of Planarity: Hanani-Tutte and Planarity Variants
- Hanani–Tutte, Monotone Drawings, and Level-Planarity
- Clustered Planarity Testing Revisited
- Re-embedding a 1-Plane Graph into a Straight-Line Drawing in Linear Time
- Hanani-Tutte for Radial Planarity II
- Beyond Level Planarity
- The graph genus problem is NP-complete
- Recognizing weakly simple polygons
- Powers of tensors and fast matrix multiplication
- Solving sparse linear equations over finite fields
- Efficient Planarity Testing
- A Linear Time Algorithm for Embedding Graphs in an Arbitrary Surface
- Clustered Planarity with Pipes
- Über wesentlich unplättbare Kurven im dreidimensionalen Raume
- Embedding Graphs into Embedded Graphs
- Hanani-Tutte and Related Results
- Detecting Weakly Simple Polygons
- Multiplying matrices faster than coppersmith-winograd
- Toward a theory of crossing numbers
- Hanani-Tutte for Radial Planarity
- How to draw a planar clustered graph
- Planarity for clustered graphs
This page was built for publication: Hanani-Tutte for approximating maps of graphs
