Graph of triangulations of a convex polygon and tree of triangulations (Q1961385)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Graph of triangulations of a convex polygon and tree of triangulations |
scientific article; zbMATH DE number 1389795
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Graph of triangulations of a convex polygon and tree of triangulations |
scientific article; zbMATH DE number 1389795 |
Statements
Graph of triangulations of a convex polygon and tree of triangulations (English)
0 references
13 November 2000
0 references
Define a graph \(G_T(n)\) with one node for each triangulation of a convex \(n\)-gon. Place an edge between each pair of nodes that differ by a single flip: two triangles forming a quadrilateral are exchanged for the other pair of triangles forming the same quadrilateral. In this paper there is introduced a tree of all triangulations of polygons with any number of vertices which gives a unified framework in which several results on \(G_T(n)\) admit new and simple proofs.
0 references
simple polygon
0 references
triangulation
0 references
flipping
0 references
binary tree
0 references
rotation
0 references
outerplanar graph
0 references
Hamiltonian graph
0 references
0.91125953
0 references
0.9014991
0 references
0.89357173
0 references
0.89074564
0 references
0.8889122
0 references
