Pages that link to "Item:Q409458"
From MaRDI portal
The following pages link to Improved bounds for spanning trees with many leaves (Q409458):
Displayed 7 items.
- A 2-approximation algorithm for finding a spanning tree with maximum number of leaves (Q513269) (← links)
- The \(k\)-leaf spanning tree problem admits a klam value of 39 (Q1678098) (← links)
- Connected Domination (Q3384607) (← links)
- Flexible list colorings in graphs with special degeneracy conditions (Q6046649) (← links)
- Flexible List Colorings in Graphs with Special Degeneracy Conditions (Q6065433) (← links)
- A Simple 2-Approximation for Maximum-Leaf Spanning Tree (Q6066463) (← links)
- Spanning trees with few non-leaves (Q6076183) (← links)