The following pages link to (Q4897473):
Displaying 17 items.
- Spanning 3-ended trees in \(k\)-connected \(K_{1,4}\)-free graphs (Q477134) (← links)
- Spanning trees: A survey (Q659663) (← links)
- On 3-stable number conditions in \(n\)-connected claw-free graphs (Q724867) (← links)
- Spanning trees with a bounded number of branch vertices in a claw-free graph (Q742583) (← links)
- Spanning 3-ended trees in almost claw-free graphs (Q1723356) (← links)
- Depth first search in claw-free graphs (Q1744633) (← links)
- Spanning 5-ended trees in \(K_{1,5}\)-free graphs (Q1988569) (← links)
- Spanning trees with few peripheral branch vertices (Q2233620) (← links)
- On spanning trees with few branch vertices (Q2279263) (← links)
- Spanning trees with at most 6 leaves in \(K_{1,5}\)-free graphs (Q2298039) (← links)
- Spanning \(k\)-ended trees in quasi-claw-free graphs (Q2302022) (← 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)
- Spanning k-ended trees of 3-regular connected graphs (Q5006619) (← links)
- Spanning trees with at most 4 leaves in \(K_{1, 5}\)-free graphs (Q5918150) (← links)
- Spanning trees with at most 4 leaves in \(K_{1, 5}\)-free graphs (Q5919575) (← links)
