Pages that link to "Item:Q1988553"
From MaRDI portal
The following pages link to Spanning trees of connected \(K_{1,t}\)-free graphs whose stems have a few leaves (Q1988553):
Displaying 6 items.
- Spanning trees whose stems have a bounded number of branch vertices (Q726654) (← links)
- Spanning trees with few peripheral branch vertices (Q2233620) (← links)
- The maximum number of spanning trees of a graph with given matching number (Q2239004) (← 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)