A history of flips in combinatorial triangulations

DOI10.1007/978-3-642-34191-5_3zbMATH Open1374.05067arXiv1206.0303OpenAlexW1791109262MaRDI QIDQ4899262FDOQ4899262

Authors: Prosenjit Bose, Sander Verdonschot 

Publication date: 7 January 2013

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

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.

Full work available at URL: https://arxiv.org/abs/1206.0303

Recommendations

• Flipping edges in triangulations
• Flips in planar graphs
• SIMULTANEOUS EDGE FLIPPING IN TRIANGULATIONS
• Flipping in spirals
• Diagonal flips in outer-triangulations on closed surfaces

Mathematics Subject Classification ID

Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Planar graphs; geometric and topological aspects of graph theory (05C10) History of mathematics in the 20th century (01A60) History of mathematics in the 21st century (01A61) History of combinatorics (05-03)

Cites Work

• A theorem on graphs
• Flips in planar graphs
• Diagonal flips in Hamiltonian triangulations on the sphere
• Triangulations without pointed spanning trees
• Title not available (Why is that?)
• Diagonal flips in labelled planar triangulations

Cited In (14)

• Flipping in spirals
• Construction of acyclically 4-colourable planar triangulations with minimum degree 4
• Flipping edge-labelled triangulations
• Flip graphs of stacked and flag triangulations of the 2-sphere
• Modular flip-graphs of one-holed surfaces
• Transforming plane triangulations by simultaneous diagonal flips
• Flip distance to some plane configurations
• Arc diagrams, flip distances, and Hamiltonian triangulations
• The geometry of flip graphs and mapping class groups
• Flip distance to some plane configurations
• A lower bound on the diameter of the flip graph
• Flip distances between graph orientations
• Flips in planar graphs
• Making triangulations 4-connected using flips

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)