The following pages link to Spanning trees of bounded degree (Q5947942):
Displaying 25 items.
- Spanning \(k\)-ended trees of bipartite graphs (Q394291) (← links)
- Spanning \(k\)-trees of bipartite graphs (Q490315) (← links)
- Some results on spanning trees (Q601948) (← links)
- Degree bounded spanning trees (Q605003) (← links)
- Spanning trees: A survey (Q659663) (← links)
- Spanning \(k\)-trees of \(n\)-connected graphs (Q659713) (← links)
- Spanning trees homeomorphic to a small tree (Q898126) (← links)
- On covering vertices of a graph by trees (Q941380) (← links)
- Degree-bounded minimum spanning trees (Q1028423) (← links)
- Trees through specified vertices (Q1043624) (← links)
- Spanning trees with bounded degrees (Q1180410) (← links)
- A note on matchings and spanning trees with bounded degrees (Q1359373) (← links)
- Near-optimal bounded-degree spanning trees (Q1840509) (← links)
- Spanning trees without adjacent vertices of degree 2 (Q2329190) (← links)
- On a spanning tree with specified leaves (Q2482350) (← links)
- Spanning trees in dense directed graphs (Q2673485) (← links)
- Bounded-Degree Spanning Trees in Randomly Perturbed Graphs (Q2957690) (← links)
- Independence trees and Hamilton cycles (Q4242952) (← links)
- Independence number and degree bounded spanning tree (Q4670065) (← links)
- Generalized degree conditions for graphs with bounded independence number (Q4698089) (← links)
- Spanning k-ended trees of 3-regular connected graphs (Q5006619) (← links)
- (Q5294907) (← links)
- Spanning Trees with Bounded Maximum Degrees of Graphs on Surfaces (Q5300503) (← links)
- A sufficient condition for a graph to have a \(k\)-tree (Q5936096) (← links)
- The number of bounded‐degree spanning trees (Q6074882) (← links)
