Pages that link to "Item:Q1930213"
From MaRDI portal
The following pages link to Bounds of the number of leaves of spanning trees in graphs without triangles (Q1930213):
Displaying 5 items.
- Lower bounds on the number of leaves in spanning trees (Q1661497) (← links)
- Bounds of the number of leaves of spanning trees (Q1930214) (← links)
- A bound on the number of leaves in a spanning tree of a connected graph of minimum degree 6 (Q2632551) (← links)
- Connected Domination (Q3384607) (← links)
- On the number of leaves of a euclidean minimal spanning tree (Q3780174) (← links)