Geometry of convex polygons and locally minimal binary trees spanning these polygons

DOI10.1070/SM1999V190N01ABEH000378MaRDI QIDQ4256982zbMATH OpenOpenAlexFDO

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

Publication date 21 June 2000

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

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

zbMATH Keywords

convex polygonlocally minimal binary treesnetworksspanning trees

Mathematics Subject Classification ID

Trees (05C05) Extremal problems in graph theory (05C35)

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
• Topologies of locally minimal planar binary trees
• scientific article; zbMATH DE number 1166303

Cited in

(10)

• Minimal binary trees with a regular boundary: The case of skeletons with five endpoints
• Geometric tree graphs of points in convex position
• Higher-dimensional nonlinear integrable equations: Asymptotics of solutions and perturbations
• Non-existence of distinct codirected locally minimal trees on a plane
• The geometry of inner spanning trees for planar polygons
• On minimal binary trees with a regular boundary
• Geometry and topology of local minimal 2-trees
• scientific article; zbMATH DE number 1166303 (Why is no real title available?)
• Topologies of locally minimal planar binary trees
• Planar locally minimal trees with boundaries on a circle

This page was built for publication: Geometry of convex polygons and locally minimal binary trees spanning these polygons

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