Lower bounds on the number of leaves in spanning trees
From MaRDI portal
Publication:1661497
DOI10.1007/S10958-018-3857-2zbMATH Open1432.05031OpenAlexW2804334609MaRDI QIDQ1661497FDOQ1661497
Authors: Y. Aharonov 
Publication date: 16 August 2018
Published in: Journal of Mathematical Sciences (New York) (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10958-018-3857-2
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
- Spanning trees in graphs of minimum degree 4 or 5
- Transversal numbers of uniform hypergraphs
- Spanning Trees with Many Leaves
- Connected Domination and Spanning Trees with Many Leaves
- Constructing full spanning trees for cubic graphs
- Spanning trees with many leaves in cubic graphs
- Spanning Trees with Many Leaves in Graphs With Minimum Degree Three
- Spanning Trees with Many Leaves in Graphs without Diamonds and Blossoms
- Spanning trees with many leaves
- Bounds of the number of leaves of spanning trees
Cited In (6)
- A lower bound on the number of spanning trees withk end-vertices
- Bounds of the number of leaves of spanning trees in graphs without triangles
- 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)
