A history of flips in combinatorial triangulations
From MaRDI portal
Publication:4899262
Abstract: Given two combinatorial triangulations, how many edge flips are necessary and sufficient to convert one into the other? This question has occupied researchers for over 75 years. We provide a comprehensive survey, including full proofs, of the various attempts to answer it.
Recommendations
Cites work
Cited in
(14)- Transforming plane triangulations by simultaneous diagonal flips
- Flip distance to some plane configurations
- Flipping in spirals
- Flip distances between graph orientations
- Flips in planar graphs
- Construction of acyclically 4-colourable planar triangulations with minimum degree 4
- Arc diagrams, flip distances, and Hamiltonian triangulations
- A lower bound on the diameter of the flip graph
- The geometry of flip graphs and mapping class groups
- Making triangulations 4-connected using flips
- Flipping edge-labelled triangulations
- Flip graphs of stacked and flag triangulations of the 2-sphere
- Flip distance to some plane configurations
- Modular flip-graphs of one-holed surfaces
This page was built for publication: A history of flips in combinatorial triangulations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4899262)