arXiv (All)
open access
Strong convexity in flip-graphs
The set of triangulations of a surface $Σ$ with a prescribed set $X$ of vertices can be endowed with a graph structure $\mathcal{F}(Σ,X)$ called a flip-graph, whose edges connect two triangulations that differ by a single arc. It is known that when $X$ is the vertex set of a convex Euclidean polygon
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Awesome graph parameters#1063805
- Local decisions, diffusive influence, and lower bounds for graphical balanced allocation#1143327
- Unified Branch-and-Bound Search for the Steiner Traveling Salesman Problem on Graphs of Convex Sets#480082
- The diameter of recoloring graphs under a maximum average degree bound#1117019
- On Edge Coloring of Multigraphs#1082904
Record · ID 820114
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive