Convex realizations of planar linear trees.

DOI10.1023/A:1024004503501MaRDI QIDQ1889461zbMATH OpenFDO

Authors N. S. Gusev

Publication date 2 December 2004

Published in Mathematical Notes (Search for Journal in Brave)

zbMATH Keywords

Steiner problemplanar treesconvex realizationminimal networks

Mathematics Subject Classification ID

Trees (05C05) Graph theory (including graph drawing) in computer science (68R10) Planar graphs; geometric and topological aspects of graph theory (05C10)

Recommendations

• scientific article; zbMATH DE number 3885930
• The twist number of planar linear trees
• Cut locus realizations on convex polyhedra
• Trees with Convex Faces and Optimal Angles
• CANONICAL DECOMPOSITION, REALIZER, SCHNYDER LABELING AND ORDERLY SPANNING TREES OF PLANE GRAPHS

Cited in

(2)

• Cut locus realizations on convex polyhedra
• Planar locally minimal trees with boundaries on a circle

This page was built for publication: Convex realizations of planar linear trees.

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