Lower bounds on the number of leaves in spanning trees
From MaRDI portal
(Redirected from Publication:1661497)
Recommendations
- Bounds of the number of leaves of spanning trees
- Bounds of the number of leaves of spanning trees in graphs without triangles
- Spanning trees with many leaves
- Spanning trees with many leaves: lower bounds in terms of the number of vertices of degree 1, 3 and at least 4
- Spanning trees with many leaves: new lower bounds in terms of the number of vertices of degree 3 and at least 4
Cites work
- Bounds of the number of leaves of spanning trees
- Connected Domination and Spanning Trees with Many Leaves
- Constructing full spanning trees for cubic graphs
- Spanning Trees with Many Leaves
- Spanning Trees with Many Leaves in Graphs With Minimum Degree Three
- Spanning Trees with Many Leaves in Graphs without Diamonds and Blossoms
- Spanning trees in graphs of minimum degree 4 or 5
- Spanning trees with many leaves
- Spanning trees with many leaves in cubic graphs
- Transversal numbers of uniform hypergraphs
Cited in
(8)- A lower bound on the number of spanning trees withk end-vertices
- Bounds on the leaf number in graphs of girth 4 or 5
- Bounds of the number of leaves of spanning trees in graphs without triangles
- Lower bounds on the leaf number in graphs with forbidden subgraphs
- On the number of leaves of a euclidean minimal spanning tree
- Bounds of the number of leaves of spanning trees
- Transforming spanning trees: A lower bound
- A bound on the number of leaves in a spanning tree of a connected graph of minimum degree 6
This page was built for publication: Lower bounds on the number of leaves in spanning trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1661497)
