Pages that link to "Item:Q3393426"
From MaRDI portal
The following pages link to Spanning Trees with Many Leaves in Graphs With Minimum Degree Three (Q3393426):
Displaying 16 items.
- Improved bounds for spanning trees with many leaves (Q409458) (← links)
- On graphs with few disjoint \(t\)-star minors (Q648995) (← links)
- A new algorithm for finding trees with many leaves (Q652536) (← 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)
- Graphs with forbidden subgraphs and leaf number (Q1715759) (← 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 note on connected domination number and leaf number (Q2099474) (← links)
- Connected Domination (Q3384607) (← links)
- Bounds on the leaf number in graphs of girth 4 or 5 (Q5035782) (← links)
- Lower bounds on the leaf number in graphs with forbidden subgraphs (Q5236058) (← links)
- A 3/2-Approximation Algorithm for Finding Spanning Trees with Many Leaves in Cubic Graphs (Q5302044) (← links)
- Spanning trees with few non-leaves (Q6076183) (← links)
