Pages that link to "Item:Q1580975"
From MaRDI portal
The following pages link to The vertex degrees of minimum spanning trees (Q1580975):
Displaying 9 items.
- On generalizations of network design problems with degree bounds (Q378106) (← links)
- Spanning trees in graphs of minimum degree 4 or 5 (Q1196990) (← links)
- Minimum degree and minimum number of edge-disjoint trees (Q1420598) (← links)
- Vertex arboricity and maximum degree (Q1894756) (← links)
- Low-degree minimum spanning trees (Q1895968) (← links)
- Degree bounded bottleneck spanning trees in three dimensions (Q2292155) (← links)
- Low-degree minimal spanning trees in normed spaces (Q2488684) (← links)
- The Euclidean degree-4 minimum spanning tree problem is NP-hard (Q5370716) (← links)
- The expected degree of minimal spanning forests (Q5915869) (← links)