Happy endings for flip graphs

DOI10.1145/1247069.1247084zbMath1404.05206arXivcs/0610092OpenAlexW1990763808MaRDI QIDQ2968066

Publication date: 9 March 2017

Published in: Proceedings of the twenty-third annual symposium on Computational geometry - SCG '07 (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Structural characterization of families of graphs (05C75) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (14)

Flip graphs of bounded degree triangulations ⋮ Correction to: ``Geometry of log-concave density estimation ⋮ A proof of the orbit conjecture for flipping edge-labelled triangulations ⋮ Flip distance between triangulations of a simple polygon is NP-complete ⋮ Flip paths between lattice triangulations ⋮ Flipping edge-labelled triangulations ⋮ The rotation distance of brooms ⋮ Flip distance between two triangulations of a point set is NP-complete ⋮ Flip distance between triangulations of a planar point set is APX-hard ⋮ Every large point set contains many collinear points or an empty pentagon ⋮ Flips in planar graphs ⋮ Rainbow Cycles in Flip Graphs ⋮ Rainbow Cycles in Flip Graphs. ⋮ Random lattice triangulations: structure and algorithms

This page was built for publication: Happy endings for flip graphs