The vertex degrees of minimum spanning trees
From MaRDI portal
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
Cites work
- scientific article; zbMATH DE number 1163708 (Why is no real title available?)
- A Property of Minkowskian Circles
- Abschätzungen für die Anzahl der konvexen Körper, die einen konvexen Körper berühren
- Efficient algorithms for a family of matroid intersection problems
- Finding Minimum Spanning Trees
- Low-degree minimum spanning trees
- On a conjecture of H. Hadwiger
- On the History of the Minimum Spanning Tree Problem
- On the shortest spanning subtree of a graph and the traveling salesman problem
- On two geometric problems related to the travelling salesman problem
- Steiner minimal trees
- Topological design of centralized computer networks—formulations and algorithms
- Über Treffanzahlen bei translationsgleichen Eikörpern
Cited in
(9)- The Euclidean degree-4 minimum spanning tree problem is NP-hard
- 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
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)
