Bounds of the number of leaves of spanning trees in graphs without triangles
From MaRDI portal
Publication:1930213
DOI10.1007/s10958-012-0880-6zbMath1256.05106OpenAlexW2014264838MaRDI QIDQ1930213
Publication date: 10 January 2013
Published in: Journal of Mathematical Sciences (New York) (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10958-012-0880-6
Related Items
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