A lower bound on the number of spanning trees withk end-vertices
From MaRDI portal
Publication:3801584
DOI10.1002/jgt.3190120110zbMath0655.05038OpenAlexW1970554661MaRDI QIDQ3801584
Katherine Heinrich, Gui Zhen Liu
Publication date: 1988
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jgt.3190120110
Related Items (4)
On a tree graph defined by a set of cycles ⋮ The biplanar tree graph ⋮ Spanning trees: A survey ⋮ The basis graph of a bicolored matroid
This page was built for publication: A lower bound on the number of spanning trees withk end-vertices
