The following pages link to Spanning trees with few leaves (Q2464051):
Displaying 23 items.
- Spanning trees with small degrees and few leaves (Q452956) (← links)
- Degree bounded spanning trees (Q605003) (← links)
- Spanning trees: A survey (Q659663) (← 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)
- Packing trees with constraints on the leaf degree (Q1014830) (← links)
- Spanning trees with bounded degrees (Q1180410) (← links)
- On spanning trees with few branch vertices (Q2279263) (← links)
- On a spanning tree with specified leaves (Q2482350) (← links)
- Unrooted non-binary tree-based phylogenetic networks (Q2656952) (← links)
- Conditions for spanning trees whose internal subtrees have few branch vertices and leaves (Q2693743) (← links)
- A condition ensuring that a connected graph has a spanning tree with few leaves (Q2699565) (← links)
- A survey on algorithms for the maximum internal spanning tree and related problems (Q2861557) (← links)
- Vulnerability bounds on the number of spanning tree leaves (Q3184286) (← links)
- Spanning trees with leaf distance at least four (Q3445504) (← links)
- Spanning trees with a bounded number of leaves (Q4690981) (← links)
- (Q4982929) (← links)
- Spanning Trees with Few Branch Vertices (Q5232165) (← links)
- Spanning trees with many leaves (Q5919174) (← links)
- Spanning trees with constraints on the leaf degree (Q5954239) (← links)
- Spectral radius and spanning trees of graphs (Q6041529) (← links)
- Spanning trees in graphs of high minimum degree with a universal vertex II: A tight result (Q6094048) (← links)
- Characterizing spanning trees via the size or the spectral radius of graphs (Q6657283) (← links)
