Minimal binary trees with regular boundary: the case of sceletons with four ends

DOI10.1070/SM1996v187n04ABEH000124zbMath0868.05021MaRDI QIDQ4334958

A. A. Tuzhilin

Publication date: 23 April 1997

Published in: Sbornik: Mathematics (Search for Journal in Brave)

zbMATH Keywords

regular polygonsminimal binary trees

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Trees (05C05) Extremal problems in graph theory (05C35) Transportation, logistics and supply chain management (90B06) Optimization of shapes other than minimal surfaces (49Q10) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (2)

Minimal Networks: A Review ⋮ Minimal binary trees with a regular boundary: The case of skeletons with five endpoints

This page was built for publication: Minimal binary trees with regular boundary: the case of sceletons with four ends