Pages that link to "Item:Q1877652"
From MaRDI portal
The following pages link to Spanning spiders and light-splitting switches (Q1877652):
Displayed 16 items.
- An FPT algorithm in polynomial space for the directed Steiner tree problem with limited number of diffusing nodes (Q477657) (← links)
- Spanning trees with at most \(k\) leaves in \(K_{1,4}\)-free graphs (Q641183) (← links)
- Spanning trees: A survey (Q659663) (← links)
- Spanning trees whose stems have a bounded number of branch vertices (Q726654) (← links)
- Spanning trees with a bounded number of branch vertices in a claw-free graph (Q742583) (← links)
- Spanning trees whose stems are spiders (Q897247) (← links)
- Spanning trees homeomorphic to a small tree (Q898126) (← links)
- Spider covers and their applications (Q1935978) (← links)
- Relations, models and a memetic approach for three degree-dependent spanning tree problems (Q2255965) (← links)
- Approximating spanning trees with few branches (Q2344216) (← links)
- An effective decomposition approach and heuristics to generate spanning trees with a small number of branch vertices (Q2374371) (← links)
- On finding spanning trees with few leaves (Q2380066) (← links)
- Neighborhood unions and extremal spanning trees (Q2427493) (← links)
- The distance spectral radius of graphs with given number of odd vertices (Q2813058) (← links)
- Degree Conditions for Spanning Brooms (Q2930040) (← links)
- Leaf-Critical and Leaf-Stable Graphs (Q2978184) (← links)