Pages that link to "Item:Q1930214"
From MaRDI portal
The following pages link to Bounds of the number of leaves of spanning trees (Q1930214):
Displaying 17 items.
- Some results on spanning trees (Q601948) (← 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)
- Spanning trees with many leaves and average distance (Q1010741) (← links)
- A lower bound on solutions of Chartrand's problem (Q1065813) (← 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)
- Fixing monotone Boolean networks asynchronously (Q2201799) (← links)
- Structural aspects of semigroups based on digraphs (Q2328130) (← links)
- A bound on the number of leaves in a spanning tree of a connected graph of minimum degree 6 (Q2632551) (← links)
- Vulnerability bounds on the number of spanning tree leaves (Q3184286) (← links)
- Independent sets in graphs without subtrees with many leaves (Q3186851) (← links)
- Connected Domination (Q3384607) (← links)
- On the number of leaves of a euclidean minimal spanning tree (Q3780174) (← links)
- Spanning trees with a bounded number of leaves (Q4690981) (← links)
- Spanning trees with leaves bounded by independence number (Q5505231) (← links)
- Spanning trees with many leaves (Q5890331) (← links)
