Bounds of the number of leaves of spanning trees
From MaRDI portal
Publication:1930214
DOI10.1007/s10958-012-0881-5zbMath1256.05107arXiv1111.3266MaRDI QIDQ1930214
Publication date: 10 January 2013
Published in: Journal of Mathematical Sciences (New York) (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1111.3266
Related Items
Spanning trees with many leaves: new lower bounds in terms of the number of vertices of degree 3 and at least 4, Spanning trees with many leaves: lower bounds in terms of the number of vertices of degree 1, 3 and at least 4, Lower bounds on the number of leaves in spanning trees, Bounds of the number of leaves of spanning trees in graphs without triangles, Fixing monotone Boolean networks asynchronously, Structural aspects of semigroups based on digraphs, Independent sets in graphs without subtrees with many leaves, Connected Domination
Cites Work
- Constructing full spanning trees for cubic graphs
- Spanning trees in graphs of minimum degree 4 or 5
- Transversal numbers of uniform hypergraphs
- Spanning trees with many leaves in cubic graphs
- Spanning Trees with Many Leaves
- Spanning Trees with Many Leaves in Graphs With Minimum Degree Three
- Connected Domination and Spanning Trees with Many Leaves
- Spanning Trees with Many Leaves in Graphs without Diamonds and Blossoms
- Spanning trees with many leaves