On minimal graphs containing n given points

DOI10.21136/CPMF.1934.122548MaRDI QIDQ4756666zbMATH OpenOpenAlexFDO

Authors Vojtěch Jarník, M. Kössler

Publication date 1934

Full work available at URL https://doi.org/10.21136/cpmf.1934.122548

zbMATH Keywords

topology

Cited in

(9)

• Bifurcations of binary types of Steiner minimal networks in the plane
• Bifurcations of Steiner tree topologies in the plane
• A continuity criterion for Steiner-type ratios in the Gromov-Hausdorff space
• Combination algorithms for Steiner tree variants
• Computing a Minimum-Cost k-Hop Steiner Tree in Tree-Like Metrics
• On Hop-Constrained Steiner Trees in Tree-Like Metrics
• An initial study of budgeted Steiner networks
• The Euclidean MST-ratio for bi-colored lattices
• The Fermat-Torricelli problem in normed spaces

This page was built for publication: On minimal graphs containing $n$ given points

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