Twisted ways to find plane structures in simple drawings of complete graphs
From MaRDI portal
Publication:6145668
DOI10.1007/s00454-023-00610-0zbMath1530.05130arXiv2203.06143MaRDI QIDQ6145668
Alexandra Weinberger, Alfredo Daniel Garcia, Oswin Aichholzer, Birgit Vogtenhuber, F. Javier Tejel
Publication date: 9 January 2024
Published in: Discrete \& Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2203.06143
Paths and cycles (05C38) Planar graphs; geometric and topological aspects of graph theory (05C10) Graph representations (geometric and intersection representations, etc.) (05C62)
Cites Work
- Unnamed Item
- Density theorems for bipartite graphs and related Ramsey-type results
- On edges crossing few other edges in simple topological complete graphs
- Proof of a conjecture of Burr, Grünbaum, and Sloane
- Linear algorithms to recognize outerplanar and maximal outerplanar graphs
- Unavoidable configurations in complete topological graphs
- The crossing number of twisted graphs
- The biplanar tree graph
- Crossing numbers and combinatorial characterization of monotone drawings of \(K_n\)
- The bipartite-cylindrical crossing number of the complete bipartite graph
- Empty triangles in complete topological graphs
- Shellable drawings and the cylindrical crossing number of \(K_n\)
- A decomposition theorem for partially ordered sets
- Hanani–Tutte, Monotone Drawings, and Level-Planarity
- Monotone Crossing Number
- Notes on the Twisted Graph
- Estimating the Number of Disjoint Edges in Simple Topological Graphs via Cylindrical Drawings
- On plane subgraphs of complete topological drawings
- Topological graphs
- A proof of the generalized Schoenflies theorem
- Combinatorial Geometry and Graph Theory
- On embeddings of spheres
- Many disjoint edges in topological graphs
- Unavoidable patterns in complete simple topological graphs
- Empty triangles in generalized twisted drawings of \(K_n\)
This page was built for publication: Twisted ways to find plane structures in simple drawings of complete graphs