Pages that link to "Item:Q744554"
From MaRDI portal
The following pages link to Spanning trees with many leaves: lower bounds in terms of the number of vertices of degree 1, 3 and at least 4 (Q744554):
Displaying 20 items.
- Spanning trees with bounded degrees and leaves (Q271638) (← links)
- Improved bounds for spanning trees with many leaves (Q409458) (← links)
- Some results on spanning trees (Q601948) (← 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)
- Arbres avec un nombre maximum de sommets pendants (Q793746) (← links)
- Lower bounds on the number of leaves in spanning trees (Q1661497) (← links)
- Degree conditions for graphs to have spanning trees with few branch vertices and leaves (Q1733871) (← 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)
- Constructing a spanning tree with many leaves (Q2256702) (← links)
- On a spanning \(k\)-tree in which specified vertices have degree less than \(k\) (Q2259579) (← links)
- Spanning trees with few leaves (Q2464051) (← 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)
- Connected Domination (Q3384607) (← 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)
- Spanning trees with constraints on the leaf degree (Q5954239) (← links)
