Pages that link to "Item:Q3035303"
From MaRDI portal
The following pages link to Spanning trees with many leaves in cubic graphs (Q3035303):
Displayed 11 items.
- Vertex cover kernelization revisited. Upper and lower bounds for a refined parameter (Q372970) (← links)
- Improved bounds for spanning trees with many leaves (Q409458) (← links)
- Spanning trees: A survey (Q659663) (← links)
- Connected domination of regular graphs (Q1025488) (← links)
- Spanning trees in graphs of minimum degree 4 or 5 (Q1196990) (← 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)
- 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)