Untangling two systems of noncrossing curves

DOI10.1007/s11856-016-1294-9zbMath1347.57022arXiv1302.6475OpenAlexW2403587525MaRDI QIDQ2630858

Eric Sedgwick, Uli Wagner, Martin Tancer, Ji{ří} Matoušek

Publication date: 22 July 2016

Published in: Israel Journal of Mathematics, Graph Drawing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1302.6475

zbMATH Keywords

curves on 2-manifoldsLickorish's theoremsimultaneous planar drawings

Mathematics Subject Classification ID

General low-dimensional topology (57M99) Planar graphs; geometric and topological aspects of graph theory (05C10)

Related Items (6)

Singular levels and topological invariants of Morse-Bott foliations on non-orientable surfaces ⋮ Shortest path embeddings of graphs on surfaces ⋮ Low-dimensional topology. Abstracts from the workshop held January 15--21, 2023 ⋮ Explicit bounds for graph minors ⋮ A lower bound on the tree-width of graphs with irrelevant vertices ⋮ Discrete systolic inequalities and decompositions of triangulated surfaces

Uses Software

• MathOverflow

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Hardness of embedding simplicial complexes in \(\mathbb R^d\)
• A representation of orientable combinatorial 3-manifolds
• Finding shortest non-separating and non-contractible cycles for topologically embedded graphs
• String graphs requiring exponential representations
• Decision problems in the space of Dehn fillings
• Singular Lagrangian manifolds and semiclassical analysis.
• Conway's ZIP Proof
• Embeddability in the 3-Sphere Is Decidable
• Subexponential parameterized algorithms on bounded-genus graphs and H -minor-free graphs
• Embedding Vertices at Points: Few Bends Suffice for Planar Graphs
• Simultaneous Embedding of Planar Graphs with Few Bends
• Computing a canonical polygonal schema of an orientable triangulated surface
• Recognizing string graphs in NP

This page was built for publication: Untangling two systems of noncrossing curves