Lower bounds on the number of leaves in spanning trees

DOI10.1007/s10958-018-3857-2zbMath1432.05031OpenAlexW2804334609MaRDI QIDQ1661497

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

Mathematics Subject Classification ID

Trees (05C05) Enumeration in graph theory (05C30) Connectivity (05C40)

Cites Work

• Constructing full spanning trees for cubic graphs
• Spanning trees in graphs of minimum degree 4 or 5
• Transversal numbers of uniform hypergraphs
• Bounds of the number of leaves of spanning trees
• 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

This page was built for publication: Lower bounds on the number of leaves in spanning trees