Pages that link to "Item:Q3225144"
From MaRDI portal
The following pages link to A 3/2-Approximation Algorithm for Finding Spanning Trees with Many Leaves in Cubic Graphs (Q3225144):
Displayed 5 items.
- Improved bounds for spanning trees with many leaves (Q409458) (← links)
- A 2-approximation algorithm for finding a spanning tree with maximum number of leaves (Q513269) (← links)
- Further results on the total monochromatic connectivity of graphs (Q2168754) (← links)
- Robust Connectivity of Graphs on Surfaces (Q5084099) (← links)
- Leafy spanning arborescences in DAGs (Q5970768) (← links)