Spanning trees with few non-leaves
From MaRDI portal
Publication:6076183
DOI10.1007/s11856-023-2499-3zbMath1525.05021MaRDI QIDQ6076183
Publication date: 23 October 2023
Published in: Israel Journal of Mathematics (Search for Journal in Brave)
Trees (05C05) Probability distributions: general theory (60E05) Combinatorial probability (60C05) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25) Connectivity (05C40)
Cites Work
- Unnamed Item
- Improved bounds for spanning trees with many leaves
- Constructing full spanning trees for cubic graphs
- Spanning trees in graphs of minimum degree 4 or 5
- On the ratio of optimal integral and fractional covers
- Transversal numbers of uniform hypergraphs
- Spanning trees with many leaves in cubic graphs
- High degree graphs contain large-star factors
- Spanning Trees with Many Leaves
- Spanning Trees with Many Leaves in Graphs With Minimum Degree Three
- Connected Domination and Spanning Trees with Many Leaves
- Negative Moments of Positive Random Variables
- Spanning trees with many leaves
This page was built for publication: Spanning trees with few non-leaves