Skip to search formSkip to main contentSkip to account menu

Flip graph

Known as: Flip-graph 
A flip graph is a graph whose vertices are combinatorial or geometric objects, and whose edges link two of these objects when they can be obtained… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2018
2018
This paper studied the geometric and combinatorial aspects of the classical Lawson's flip algorithm in 1972. Let A be a finite… 
2018
2018
  • Vincent Pilaud
  • 2018
  • Corpus ID: 52234661
2018
2018
We introduce topological prismatoids, a combinatorial abstraction of the (geometric) prismatoids used in the recent counter… 
2017
2017
Let Gn,m be the grid graph with n columns and m rows. Let Hn,m be the graph whose vertices are the Hamiltonian paths in Gn,m… 
2017
2017
Garver and McConville recently introduced two lattices associated to a tree: the lattice of biclosed sets and the oriented flip… 
2014
2014
In this paper we present combinatorial and geometric results about Thompson’s group T by comparing multiple viewpoints of the… 
Review
2014
Review
2014
Description. In this project, we will investigate a topic that has fascinated geometers for many years: the flip graph of… 
2010
2010
Flips of diagonals in colored triangle-free triangulations of a convex polygon are interpreted as moves between two adjacent… 
2004
2004
Let P be a set of points in the plane and assume that P is in general position. A triangulation of P is a maximal non-crossing…