The vertex degrees of minimum spanning trees

DOI10.1016/S0377-2217(99)00458-0zbMATH Open0952.90041OpenAlexW1969467316MaRDI QIDQ1580975FDOQ1580975

Authors: 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

Recommendations

• Degree-bounded minimum spanning trees
• On numbers of vertices of maximum degree in the spanning trees of a graph
• Minimum spanning trees in \(d\) dimensions
• scientific article; zbMATH DE number 1436136
• Tree-depth and vertex-minors
• Spanning trees with minimum weighted degrees
• Minimum bottleneck spanning trees with degree bounds
• Matroidal degree-bounded minimum spanning trees
• On Minimum Spanning Trees and Determinants
• Minimum spanning hypertrees

zbMATH Keywords

graph theoryminimum spanning trees

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (9)

• Probabilistic Analysis of the Degree Bounded Minimum Spanning Tree Problem
• Minimum degree and minimum number of edge-disjoint trees
• Spanning trees in graphs of minimum degree 4 or 5
• Low-degree minimum spanning trees
• Low-degree minimal spanning trees in normed spaces
• Vertex arboricity and maximum degree
• Degree bounded bottleneck spanning trees in three dimensions
• The expected degree of minimal spanning forests
• The Euclidean degree-4 minimum spanning tree problem is NP-hard

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

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