Constructing a spanning tree with many leaves
From MaRDI portal
Publication:2256702
DOI10.1007/s10958-011-0611-4zbMath1402.05200OpenAlexW2094152042MaRDI QIDQ2256702
Publication date: 20 February 2015
Published in: Journal of Mathematical Sciences (New York) (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10958-011-0611-4
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Solving connected dominating set faster than \(2^n\)
- Constructing full spanning trees for cubic graphs
- Spanning trees in graphs of minimum degree 4 or 5
- On the approximability of some Maximum Spanning Tree Problems
- Transversal numbers of uniform hypergraphs
- Spanning Trees with Many Leaves
- Connected Domination and Spanning Trees with Many Leaves
This page was built for publication: Constructing a spanning tree with many leaves