Pages that link to "Item:Q5074694"
From MaRDI portal
The following pages link to Degree Conditions for Claw-Free Graphs to Have Spanning Trees with at Most Five Branch Vertices and Leaves in Total (Q5074694):
Displaying 6 items.
- Spanning trees with a bounded number of branch vertices in a claw-free graph (Q742583) (← links)
- Depth first search in claw-free graphs (Q1744633) (← links)
- On spanning trees with few branch vertices (Q2279263) (← links)
- Spanning trees with few peripheral branch vertices in a connected claw-free graph (Q2694860) (← links)
- Spanning trees with at most \(5\) leaves and branch vertices in total of \(K_{1,5}\)-free graphs (Q6619687) (← links)
- Spanning trees of bipartite graphs with a bounded number of leaves and branch vertices (Q6671390) (← links)
