Graph of triangulations of a convex polygon and tree of triangulations (Q1961385): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q126550469, #quickstatements; #temporary_batch_1719490521575 |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/s0925-7721(99)00016-4 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1983134817 / rank | |||
Normal rank | |||
Latest revision as of 10:55, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Graph of triangulations of a convex polygon and tree of triangulations |
scientific article |
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
