This article is cited in 5 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.

UDC: 514.112.4+519.17

Received: 25.05.1995
Revised: 03.03.1997

DOI: 10.4213/mzm1574

 English version: Mathematical Notes, 1997, 61:6, 758–769

Bibliographic databases:

• 
• 
•