On minimal binary trees with a regular boundary

DOI10.1070/RM1996V051N01ABEH002754MaRDI QIDQ3125925zbMATH OpenOpenAlexFDO

Authors A. A. Tuzhilin, A. O. Ivanov

Publication date 6 May 1997

Published in Russian Mathematical Surveys (Search for Journal in Brave)

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

zbMATH Keywords

diagonal triangulationendsminimal binary treesregular polygonskeletons

Mathematics Subject Classification ID

Trees (05C05)

Recommendations

• Minimal binary trees with a regular boundary: The case of skeletons with five endpoints
• Minimal binary trees with regular boundary: the case of sceletons with four ends
• scientific article; zbMATH DE number 1166303
• Geometry of convex polygons and locally minimal binary trees spanning these polygons

Cited in

(8)

• Minimal binary trees with a regular boundary: The case of skeletons with five endpoints
• Non-existence of distinct codirected locally minimal trees on a plane
• scientific article; zbMATH DE number 5788344 (Why is no real title available?)
• Minimal binary trees with regular boundary: the case of sceletons with four ends
• scientific article; zbMATH DE number 1166303 (Why is no real title available?)
• scientific article; zbMATH DE number 7310136 (Why is no real title available?)
• Minimal networks on the regular \(n\)-dimensional simplex
• Planar locally minimal trees with boundaries on a circle

This page was built for publication: On minimal binary trees with a regular boundary

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