The vertex degrees of minimum spanning trees

DOI10.1016/S0377-2217(99)00458-0zbMath0952.90041OpenAlexW1969467316MaRDI QIDQ1580975

Dietmar Cieslik

Publication date: 14 September 2000

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0377-2217(99)00458-0

zbMATH Keywords

graph theoryminimum spanning trees

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Applications of graph theory (05C90)

Cites Work

• Unnamed Item
• On the shortest spanning subtree of a graph and the traveling salesman problem
• Über Treffanzahlen bei translationsgleichen Eikörpern
• Abschätzungen für die Anzahl der konvexen Körper, die einen konvexen Körper berühren
• Steiner minimal trees
• Low-degree minimum spanning trees
• On a conjecture of H. Hadwiger
• Efficient algorithms for a family of matroid intersection problems
• On two geometric problems related to the travelling salesman problem
• Topological design of centralized computer networks—formulations and algorithms
• Finding Minimum Spanning Trees
• On the History of the Minimum Spanning Tree Problem
• A Property of Minkowskian Circles

This page was built for publication: The vertex degrees of minimum spanning trees