Simple realizability of complete abstract topological graphs simplified
From MaRDI portal
Publication:2189738
DOI10.1007/s00454-020-00204-0OpenAlexW3102089065MaRDI QIDQ2189738
Publication date: 16 June 2020
Published in: Discrete \& Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1608.05867
complete graphrotation systemabstract topological graphsimple realizabilityindependent \(\mathbb{Z}_2\)-realizability
Planar graphs; geometric and topological aspects of graph theory (05C10) Graph representations (geometric and intersection representations, etc.) (05C62)
Related Items
On the Maximum Number of Crossings in Star-Simple Drawings of $K_n$ with No Empty Lens ⋮ The Complexity of Drawing a Graph in a Polygonal Region ⋮ Topological drawings meet classical theorems from convex geometry ⋮ Embeddings of \(k\)-complexes into \(2k\)-manifolds ⋮ On the Complexity of Some Geometric Problems With Fixed Parameters ⋮ On the Maximum Number of Crossings in Star-Simple Drawings of $$K_n$$ with No Empty Lens
Cites Work
- Unnamed Item
- Unnamed Item
- Improved enumeration of simple topological graphs
- Crossing numbers of graphs with rotation systems
- Simple realizability of complete abstract topological graphs in P
- How many ways can one draw a graph?
- Intersections of curves on surfaces
- String graphs. II: Recognizing string graphs is NP-hard
- A note on the parity of the number of crossings of a graph
- A successful concept for measuring non-planarity of graphs: The crossing number.
- Which crossing number is it anyway?
- The graph crossing number and its variants: a survey
- Crossing numbers and combinatorial characterization of monotone drawings of \(K_n\)
- SELF-INTERSECTION NUMBERS OF PATHS IN COMPACT SURFACES
- Facets in the Crossing Number Polytope
- Noncrossing Subgraphs in Topological Layouts
- Powers of tensors and fast matrix multiplication
- A generalization of the fast LUP matrix decomposition algorithm and applications
- Über wesentlich unplättbare Kurven im dreidimensionalen Raume
- Hanani-Tutte and Related Results
- Recent Advances in Exact Crossing Minimization (Extended Abstract)
- Multiplying matrices faster than coppersmith-winograd
- Toward a theory of crossing numbers
- Graph-Theoretic Concepts in Computer Science
- Enumeration of simple complete topological graphs
