|
This article is cited in 4 scientific papers (total in 4 papers)
Minimal binary trees with a regular boundary: The case of skeletons with five endpoints
A. A. Tuzhilin M. V. Lomonosov Moscow State University, Faculty of Mechanics and Mathematics
Abstract:
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.
Received: 25.05.1995 Revised: 03.03.1997
Citation:
A. A. Tuzhilin, “Minimal binary trees with a regular boundary: The case of skeletons with five endpoints”, Mat. Zametki, 61:6 (1997), 907–921; Math. Notes, 61:6 (1997), 758–769
Linking options:
https://www.mathnet.ru/eng/mzm1574https://doi.org/10.4213/mzm1574 https://www.mathnet.ru/eng/mzm/v61/i6/p907
|
Statistics & downloads: |
Abstract page: | 403 | Full-text PDF : | 174 | References: | 57 | First page: | 1 |
|