Pages that link to "Item:Q5919575"
From MaRDI portal
The following pages link to Spanning trees with at most 4 leaves in \(K_{1, 5}\)-free graphs (Q5919575):
Displaying 8 items.
- Spanning trees in graphs of minimum degree 4 or 5 (Q1196990) (← links)
- Spanning trees with few peripheral branch vertices (Q2233620) (← links)
- Spanning trees with few peripheral branch vertices in a connected claw-free graph (Q2694860) (← links)
- Spanning trees with at most \(k\) leaves in 2-connected \(K_{1 , r}\)-free graphs (Q2698134) (← links)
- Spanning trees whose reducible stems have a few branch vertices (Q4959538) (← links)
- Degree Conditions for Claw-Free Graphs to Have Spanning Trees with at Most Five Branch Vertices and Leaves in Total (Q5074694) (← links)
- Spectral radius and spanning trees of graphs (Q6041529) (← links)
- Spanning trees with at most \(5\) leaves and branch vertices in total of \(K_{1,5}\)-free graphs (Q6619687) (← links)
