The following pages link to (Q4411401):
Displaying 6 items.
- Complexity of the maximum leaf spanning tree problem on planar and regular graphs (Q264582) (← links)
- Max-leaves spanning tree is APX-hard for cubic graphs (Q414465) (← links)
- A 2-approximation algorithm for finding a spanning tree with maximum number of leaves (Q513269) (← links)
- Spanning trees: A survey (Q659663) (← links)
- Connected domination of regular graphs (Q1025488) (← links)
- Spanning Trees with Many Leaves in Regular Bipartite Graphs (Q5387825) (← links)
