Pages that link to "Item:Q1733871"
From MaRDI portal
The following pages link to Degree conditions for graphs to have spanning trees with few branch vertices and leaves (Q1733871):
Displaying 11 items.
- Spanning trees with bounded degrees and leaves (Q271638) (← links)
- Spanning trees with few peripheral branch vertices (Q2233620) (← links)
- A note on a spanning \((\alpha ,\beta )\)-ended tree in a bipartite graph (Q2413635) (← links)
- Conditions for spanning trees whose internal subtrees have few branch vertices and leaves (Q2693743) (← links)
- Spanning trees with few peripheral branch vertices in a connected claw-free graph (Q2694860) (← 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)
- Spanning trees with constraints on the leaf degree (Q5954239) (← links)
- Spanning trees with few branch vertices in \(K_{1,4}\)-free graphs (Q6542034) (← 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)
