Pages that link to "Item:Q5458557"
From MaRDI portal
The following pages link to Spanning Trees with Many Leaves in Graphs without Diamonds and Blossoms (Q5458557):
Displaying 16 items.
- Improved bounds for spanning trees with many leaves (Q409458) (← links)
- Max-leaves spanning tree is APX-hard for cubic graphs (Q414465) (← links)
- A new algorithm for finding trees with many leaves (Q652536) (← links)
- An exact algorithm for the maximum leaf spanning tree problem (Q653320) (← links)
- Spanning trees: A survey (Q659663) (← links)
- Spanning trees with many leaves: new lower bounds in terms of the number of vertices of degree 3 and at least 4 (Q744553) (← links)
- Spanning trees with many leaves: lower bounds in terms of the number of vertices of degree 1, 3 and at least 4 (Q744554) (← links)
- Lower bounds on the number of leaves in spanning trees (Q1661497) (← links)
- The \(k\)-leaf spanning tree problem admits a klam value of 39 (Q1678098) (← links)
- Spanning 3-ended trees in almost claw-free graphs (Q1723356) (← links)
- The existence of spanning ended system on claw-free graphs (Q1793386) (← links)
- Bounds of the number of leaves of spanning trees in graphs without triangles (Q1930213) (← links)
- Bounds of the number of leaves of spanning trees (Q1930214) (← links)
- Out-branchings with Maximal Number of Leaves or Internal Vertices: Algorithmic Results and Open Problems (Q2839214) (← links)
- Tight Bounds and a Fast FPT Algorithm for Directed Max-Leaf Spanning Tree (Q3541089) (← links)
- A 3/2-Approximation Algorithm for Finding Spanning Trees with Many Leaves in Cubic Graphs (Q5302044) (← links)
