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

DOI10.1070/SM1996V187N04ABEH000124MaRDI QIDQ4334958zbMATH OpenFDO

Authors A. A. Tuzhilin

Publication date 23 April 1997

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

Full work available at URL https://doi.org/10.1070/SM1996V187N04ABEH000124

zbMATH Keywords

minimal binary treesregular polygons

Mathematics Subject Classification ID

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

Recommendations

• Minimal binary trees with a regular boundary: The case of skeletons with five endpoints
• On minimal binary trees with a regular boundary
• Some upper bounds for minimal trees
• Trees with minimal index and diameter at most four
• The minimal-ABC trees with \(B_2\)-branches
• Steiner minimal trees on sets of four points
• scientific article; zbMATH DE number 146433
• scientific article; zbMATH DE number 1166298
• scientific article; zbMATH DE number 1166303
• Minimal trees of given search number

Cited in

(5)

• Minimal binary trees with a regular boundary: The case of skeletons with five endpoints
• Minimal networks: a review
• On minimal binary trees with a regular boundary
• Geometry of convex polygons and locally minimal binary trees spanning these polygons
• scientific article; zbMATH DE number 1166303 (Why is no real title available?)

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4334958)