---
res:
  bibo_abstract:
  - "In a straight-line embedded triangulation of a point set P in the plane, removing
    an inner edge and—provided the resulting quadrilateral is convex—adding the other
    diagonal is called an edge flip. The (edge) flip graph has all triangulations
    as vertices, and a pair of triangulations is adjacent if they can be obtained
    from each other by an edge flip. The goal of this paper is to contribute to a
    better understanding of the flip graph, with an emphasis on its connectivity.\r\nFor
    sets in general position, it is known that every triangulation allows at least
    edge flips (a tight bound) which gives the minimum degree of any flip graph for
    n points. We show that for every point set P in general position, the flip graph
    is at least -vertex connected. Somewhat more strongly, we show that the vertex
    connectivity equals the minimum degree occurring in the flip graph, i.e. the minimum
    number of flippable edges in any triangulation of P, provided P is large enough.
    Finally, we exhibit some of the geometry of the flip graph by showing that the
    flip graph can be covered by 1-skeletons of polytopes of dimension (products of
    associahedra).\r\nA corresponding result ((n – 3)-vertex connectedness) can be
    shown for the bistellar flip graph of partial triangulations, i.e. the set of
    all triangulations of subsets of P which contain all extreme points of P. This
    will be treated separately in a second part.@eng"
  bibo_authorlist:
  - foaf_Person:
      foaf_givenName: Uli
      foaf_name: Wagner, Uli
      foaf_surname: Wagner
      foaf_workInfoHomepage: http://www.librecat.org/personId=36690CA2-F248-11E8-B48F-1D18A9856A87
    orcid: 0000-0002-1494-0568
  - foaf_Person:
      foaf_givenName: Emo
      foaf_name: Welzl, Emo
      foaf_surname: Welzl
  bibo_doi: 10.1137/1.9781611975994.172
  bibo_volume: 2020-January
  dct_date: 2020^xs_gYear
  dct_isPartOf:
  - http://id.crossref.org/issn/9781611975994
  dct_language: eng
  dct_publisher: SIAM@
  dct_title: 'Connectivity of triangulation flip graphs in the plane (Part I: Edge
    flips)@'
...