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)

Related topics

Related topics

15 relations
Connectivity (graph theory)Delaunay triangulationDomino tilingGeometric graph theory

Broader (1)

Graph theory

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2019
2019
Flip cycles in plabic graphs
Planar bicolored (plabic) graphs are combinatorial objects introduced by Postnikov to give parameterizations of the positroid… 
2018
2018
On Monotone Sequences of Directed Flips, Triangulations of Polyhedra, and Structural Properties of a Directed Flip Graph
This paper studied the geometric and combinatorial aspects of the classical Lawson's flip algorithm in 1972. Let A be a finite… 
2017
2017
Rainbow Cycles in Flip Graphs
The flip graph of triangulations has as vertices all triangulations of a convex $n$-gon, and an edge between any two… 
2015
2015
Arc diagrams, flip distances, and Hamiltonian triangulations
2015
2015
A Lower Bound on the Diameter of the Flip Graph
The flip graph is the graph whose nodes correspond to non-isomorphic combinatorial triangulations and whose edges connect pairs… 
2013
2013
Flipping edge-labelled triangulations
2013
2013
The Flip Diameter of Rectangulations and Convex Subdivisions
We study the configuration space of rectangulations and convex subdivisions of $n$ points in the plane. It is shown that a… 
2009
2009
Transforming spanning trees: A lower bound
2009
2009
Triangle-free triangulations
2006
2006
Transforming spanning trees and pseudo-triangulations
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)