Simple realizability of complete abstract topological graphs simplified

DOI10.1007/S00454-020-00204-0MaRDI QIDQ2189738zbMATH OpenOpenAlexFDO

Authors Jan Kynčl

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

zbMATH Keywords

abstract topological graphcomplete graphindependent \(\mathbb{Z}_2\)-realizabilityrotation systemsimple realizability

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Graph representations (geometric and intersection representations, etc.) (05C62)

Recommendations

• Simple realizability of complete abstract topological graphs simplified
• Simple realizability of complete abstract topological graphs in P
• The Complexity of Several Realizability Problems for Abstract Topological Graphs
• scientific article; zbMATH DE number 7030516
• Saturated simple and \(k\)-simple topological graphs

Cites work

• A generalization of the fast LUP matrix decomposition algorithm and applications
• 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.
• Crossing numbers and combinatorial characterization of monotone drawings of \(K_n\)
• Crossing numbers of graphs with rotation systems
• Enumeration of simple complete topological graphs
• Facets in the crossing number polytope
• Graph-Theoretic Concepts in Computer Science
• Hanani-Tutte and related results
• How many ways can one draw a graph?
• scientific article; zbMATH DE number 434700 (Why is no real title available?)
• scientific article; zbMATH DE number 4142090 (Why is no real title available?)
• Improved enumeration of simple topological graphs
• Intersections of curves on surfaces
• Multiplying matrices faster than coppersmith-winograd
• Noncrossing Subgraphs in Topological Layouts
• Powers of tensors and fast matrix multiplication
• Recent advances in exact crossing minimization (extended abstract)
• Self-intersection numbers of paths in compact surfaces
• Simple realizability of complete abstract topological graphs in P
• String graphs. II: Recognizing string graphs is NP-hard
• The graph crossing number and its variants: a survey
• Toward a theory of crossing numbers
• Which crossing number is it anyway?
• Über wesentlich unplättbare Kurven im dreidimensionalen Raume

Cited in

(16)

• Simple realizability of complete abstract topological graphs simplified
• On the Maximum Number of Crossings in Star-Simple Drawings of K_n with No Empty Lens
• 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
• The Complexity of Several Realizability Problems for Abstract Topological Graphs
• On the complexity of some geometric problems with fixed parameters
• Topological drawings meet classical theorems from convex geometry
• Embeddings of k-complexes into 2k-manifolds
• Simple realizability of complete abstract topological graphs in P
• Rotation systems and simple drawings in surfaces
• Separable drawings: extendability and crossing-free Hamiltonian cycles
• Crossing-optimal extension of simple drawings
• Simple realizability of abstract topological graphs
• On winding numbers of almost embeddings of K₄ in the plane
• Characterizing and recognizing twistedness
• Separable drawings: extendability and crossing-free Hamiltonian cycles

This page was built for publication: Simple realizability of complete abstract topological graphs simplified

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2189738)