Minimal binary trees with a regular boundary: The case of skeletons with five endpoints (Q1274069)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1238032
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Minimal binary trees with a regular boundary: The case of skeletons with five endpoints |
scientific article; zbMATH DE number 1238032 |
Statements
Minimal binary trees with a regular boundary: The case of skeletons with five endpoints (English)
0 references
11 January 1999
0 references
Locally minimal binary trees that span the vertices of regular polygons are studied. Their description is given in the dual language, that of diagonal triangulations of polygons. Diagonal triangulations of a special form, called skeletons, are considered. It is shown that planar binary trees dual to skeletons with five endpoints do not occur among locally minimal binary trees that span the vertices of regular polygons.
0 references
Steiner problem
0 references
locally minimal planar networks
0 references
diagonal triangulations
0 references
skeletons
0 references
locally minimal binary trees
0 references
regular polygons
0 references
0.9148775339126588
0 references
0.9121140837669371
0 references
0.8367206454277039
0 references
