The following pages link to Spanning Trees with Many Leaves (Q3360890):
Displaying 19 items.
- Tight Bounds and a Fast FPT Algorithm for Directed Max-Leaf Spanning Tree (Q3541089) (← links)
- (Q4982929) (← links)
- Bounds on the leaf number in graphs of girth 4 or 5 (Q5035782) (← links)
- Robust Connectivity of Graphs on Surfaces (Q5084099) (← links)
- Computing Minimum <i>k</i>-Connected <i>m</i>-Fold Dominating Set in General Graphs (Q5131721) (← links)
- Breaking the <i>O</i>(ln <i>n</i>) Barrier: An Enhanced Approximation Algorithm for Fault-Tolerant Minimum Weight Connected Dominating Set (Q5131722) (← links)
- Lower bounds on the leaf number in graphs with forbidden subgraphs (Q5236058) (← links)
- A 3/2-Approximation Algorithm for Finding Spanning Trees with Many Leaves in Cubic Graphs (Q5302044) (← links)
- Spanning Trees with Many Leaves in Regular Bipartite Graphs (Q5387825) (← links)
- A 5/3-Approximation for Finding Spanning Trees with Many Leaves in Cubic Graphs (Q5443382) (← links)
- Spanning Trees with Many Leaves in Graphs without Diamonds and Blossoms (Q5458557) (← links)
- Better Algorithms and Bounds for Directed Maximum Leaf Problems (Q5458844) (← links)
- Spanning trees with many leaves (Q5919174) (← links)
- Leafy spanning trees in hypercubes (Q5950587) (← links)
- A Simple 2-Approximation for Maximum-Leaf Spanning Tree (Q6066463) (← links)
- Spanning trees with few non-leaves (Q6076183) (← links)
- The number and average size of connected sets in graphs with degree constraints (Q6081554) (← links)
- Radius, leaf number, connected domination number and minimum degree (Q6110370) (← links)
- The minimum centroid branch spanning tree problem (Q6566796) (← links)
