Pages that link to "Item:Q744553"
From MaRDI portal
The following pages link to Spanning trees with many leaves: new lower bounds in terms of the number of vertices of degree 3 and at least 4 (Q744553):
Displaying 13 items.
- Improved bounds for spanning trees with many leaves (Q409458) (← 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)
- 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)
- Number of vertices of degree three in spanning 3-trees in square graphs (Q2009592) (← links)
- Constructing a spanning tree with many leaves (Q2256702) (← links)
- A bound on the number of leaves in a spanning tree of a connected graph of minimum degree 6 (Q2632551) (← links)
- Spanning trees with many leaves in cubic graphs (Q3035303) (← links)
- Connected Domination (Q3384607) (← links)
- Spanning trees with many leaves (Q5890331) (← links)
- Spanning trees with constraints on the leaf degree (Q5954239) (← links)
- The number and average size of connected sets in graphs with degree constraints (Q6081554) (← links)
