Empty triangles in good drawings of the complete graph
From MaRDI portal
Publication:2345507
DOI10.1007/s00373-015-1550-5zbMath1312.05094arXiv1306.5081OpenAlexW2130006374MaRDI QIDQ2345507
Thomas Hackl, Alexander Pilz, Pedro A. Ramos, Birgit Vogtenhuber, Vera Sacristán, Oswin Aichholzer
Publication date: 22 May 2015
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1306.5081
Planar graphs; geometric and topological aspects of graph theory (05C10) Graph representations (geometric and intersection representations, etc.) (05C62)
Related Items
Complete graph drawings up to triangle mutations, Convex drawings of the complete graph: topology meets geometry, Empty triangles in generalized twisted drawings of \(K_n\), Empty Triangles in Generalized Twisted Drawings of $K_n$, Empty triangles in complete topological graphs
Cites Work
- Unnamed Item
- Simple realizability of complete abstract topological graphs in P
- On empty triangles determined by points in the plane
- Konvexe Fünfecke in ebenen Punktmengen
- Empty triangles in drawings of the complete graph
- Lower bounds for the number of small convex \(k\)-holes
- The empty hexagon theorem
- Empty convex hexagons in planar point sets
- Sets with No Empty Convex 7-Gons
- Relations Between Crossing Numbers of Complete and Complete Bipartite Graphs
- Topological graphs
- The crossing number of K11 is 100
- Planar point sets with a small number of empty convex polygons