Empty triangles in generalized twisted drawings of \(K_n\)
From MaRDI portal
Publication:6117034
DOI10.1007/978-3-031-22203-0_4arXiv2208.05819OpenAlexW4317393906MaRDI QIDQ6117034
F. Javier Tejel, Alexandra Weinberger, Alfredo Daniel Garcia, Birgit Vogtenhuber
Publication date: 16 August 2023
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2208.05819
Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Related Items (2)
Cites Work
- Unavoidable configurations in complete topological graphs
- Empty triangles in drawings of the complete graph
- The crossing number of twisted graphs
- The biplanar tree graph
- Empty triangles in good drawings of the complete graph
- Empty triangles in complete topological graphs
- Lower bounds for the number of small convex \(k\)-holes
- Notes on the Twisted Graph
- Topological graphs
- Planar point sets with a small number of empty convex polygons
- Graph Drawing
- Unavoidable patterns in complete simple topological graphs
This page was built for publication: Empty triangles in generalized twisted drawings of \(K_n\)