Pages that link to "Item:Q5918150"
From MaRDI portal
The following pages link to Spanning trees with at most 4 leaves in \(K_{1, 5}\)-free graphs (Q5918150):
Displaying 11 items.
- Spanning \(k\)-forests with large components in \(K_{1,k+1}\)-free graphs (Q497365) (← links)
- Spanning trees with at most \(k\) leaves in \(K_{1,4}\)-free graphs (Q641183) (← links)
- On 2-connected spanning subgraphs with bounded degree in \(K _{1,r }\)-free graphs (Q659687) (← links)
- Spanning trees with at most 3 leaves in \(K_{1,4}\)-free graphs (Q1045112) (← links)
- Spanning trees in graphs of minimum degree 4 or 5 (Q1196990) (← links)
- Spanning trees of connected \(K_{1,t}\)-free graphs whose stems have a few leaves (Q1988553) (← links)
- Spanning 5-ended trees in \(K_{1,5}\)-free graphs (Q1988569) (← links)
- Spanning trees with at most \(k\) leaves in 2-connected \(K_{1 , r}\)-free graphs (Q2698134) (← links)
- Degree Conditions for Claw-Free Graphs to Have Spanning Trees with at Most Five Branch Vertices and Leaves in Total (Q5074694) (← links)
- Spanning trees with at most 4 leaves in \(K_{1, 5}\)-free graphs (Q5919575) (← links)
- Spanning trees with few branch vertices in \(K_{1,4}\)-free graphs (Q6542034) (← links)
