Pages that link to "Item:Q4690981"
From MaRDI portal
The following pages link to Spanning trees with a bounded number of leaves (Q4690981):
Displaying 11 items.
- Spanning trees with bounded degrees and leaves (Q271638) (← links)
- Some results on spanning trees (Q601948) (← links)
- Bounds of the number of leaves of spanning trees in graphs without triangles (Q1930213) (← links)
- Spanning trees with few leaves (Q2464051) (← links)
- A bound on the number of leaves in a spanning tree of a connected graph of minimum degree 6 (Q2632551) (← links)
- A condition ensuring that a connected graph has a spanning tree with few leaves (Q2699565) (← links)
- Spanning trees with leaf distance at least four (Q3445504) (← links)
- On the number of leaves of a euclidean minimal spanning tree (Q3780174) (← links)
- Leafy spanning arborescences in DAGs (Q5918501) (← links)
- Spanning trees with many leaves (Q5919174) (← links)
- Leafy spanning arborescences in DAGs (Q5970768) (← links)