Pages that link to "Item:Q1877652"
From MaRDI portal
The following pages link to Spanning spiders and light-splitting switches (Q1877652):
Displaying 31 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)
- On the terminal connection problem (Q831820) (← links)
- Spanning trees whose stems are spiders (Q897247) (← links)
- Spanning trees homeomorphic to a small tree (Q898126) (← links)
- Depth first search in claw-free graphs (Q1744633) (← links)
- Gallai's question and constructions of almost hypotraceable graphs (Q1752468) (← links)
- Spider covers and their applications (Q1935978) (← links)
- Spanning 5-ended trees in \(K_{1,5}\)-free graphs (Q1988569) (← links)
- Degree sums and spanning brooms of a graph (Q2144512) (← links)
- On minimum leaf spanning trees and a criticality notion (Q2182204) (← links)
- Spiders everywhere (Q2217501) (← links)
- Relations, models and a memetic approach for three degree-dependent spanning tree problems (Q2255965) (← 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)
- A multivariate analysis of the strict terminal connection problem (Q2306846) (← 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)
- Spanning Trees with Few Branch Vertices (Q5232165) (← links)
- The spanning <i>k</i>-trees, perfect matchings and spectral radius of graphs (Q5888899) (← links)
- Spanning trees with at most 4 leaves in \(K_{1, 5}\)-free graphs (Q5919575) (← links)
- On the computational difficulty of the terminal connection problem (Q6041044) (← links)
- Special cases of the minimum spanning tree problem under explorable edge and vertex uncertainty (Q6196899) (← links)
