Invariants of graph drawings in the plane
From MaRDI portal
Publication:778122
DOI10.1007/s40598-019-00128-5zbMath1442.05141arXiv1805.10237OpenAlexW3006323667MaRDI QIDQ778122
Publication date: 30 June 2020
Published in: Arnold Mathematical Journal (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1805.10237
Planar graphs; geometric and topological aspects of graph theory (05C10) Graph representations (geometric and intersection representations, etc.) (05C62)
Related Items (5)
Crossing numbers and rotation numbers of cycles in a plane immersed graph ⋮ The coloured Tverberg theorem, extensions and new results ⋮ A user’s guide to basic knot and link theory ⋮ Extendability of simplicial maps is undecidable ⋮ On embeddability of joins and their `factors'
Cites Work
- Hardness of embedding simplicial complexes in \(\mathbb R^d\)
- A geometric proof of the colored Tverberg theorem
- Singularities, expanders and topology of maps. II: From combinatorics to topology via algebraic isoperimetry
- On a topological generalization of the Tverberg theorem
- On the van Kampen-Flores theorem
- On 3-cutwidth critical graphs
- Hardness of almost embedding simplicial complexes in \(\mathbb {R}^d\)
- Stability of intersections of graphs in the plane and the van Kampen obstruction
- Note on a conjecture of Sierksma
- Van Kampen's embedding obstruction is incomplete for 2-complexes in \(\mathbb{R}^ 4\)
- Optimal bounds for the colored Tverberg problem
- Algorithmic solvability of the lifting-extension problem
- The topological Tverberg theorem and winding numbers
- Tverberg plus constraints
- Tverberg's Theorem at 50: Extensions and Counterexamples
- A Linear Time Planarity Algorithm for 2-Complexes
- Eliminating Higher-Multiplicity Intersections, II. The Deleted Product Criterion in the $r$-Metastable Range
- Embeddability in the 3-Sphere Is Decidable
- A Generalized van Kampen-Flores Theorem
- On the Cutting Edge: Simplified O(n) Planarity by Edge Addition
- On a common generalization of Borsuk's and Radon's theorem
- On a Topological Generalization of a Theorem of Tverberg
- Efficient Planarity Testing
- The Product of Nonplanar Complexes does not Imbed in 4-Space
- A Borsuk theorem for antipodal links and a spectral characterization of linklessly embeddable graphs
- Beyond the Borsuk–Ulam Theorem: The Topological Tverberg Story
- Embeddability in $\mathbb{R}^3$ is NP-hard
- A user's guide to the topological Tverberg conjecture
- Topological Tverberg Theorem: the proofs and the counterexamples
- Embedding products of graphs into Euclidean spaces
- A new invariant and parametric connected sum of embeddings
- Cutwidth I: A linear time fixed parameter algorithm
- Using the Borsuk-Ulam theorem. Lectures on topological methods in combinatorics and geometry. Written in cooperation with Anders Björner and Günter M. Ziegler
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Invariants of graph drawings in the plane
