Minimum number of partial triangulations
From MaRDI portal
Publication:2107503
DOI10.1016/j.ejc.2022.103636zbMath1506.52005arXiv2104.05855OpenAlexW3153651057MaRDI QIDQ2107503
Aleksei Volostnov, Yury Yarovikov, Andrey B. Kupavskii
Publication date: 1 December 2022
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2104.05855
Cites Work
- Triangulations. Structures for algorithms and applications
- A better upper bound on the number of triangulations of a planar point set
- A lower bound on the number of triangulations of planar point sets
- Transforming triangulations
- On the number of plane graphs
- The Number of Triangulations on Planar Point Sets
- Connectivity of Triangulation Flip Graphs in the Plane (Part I: Edge Flips)
- Connectivity of Triangulation Flip Graphs in the Plane (Part II: Bistellar Flips).
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Minimum number of partial triangulations