Publisher
Springer Science and Business Media LLC
Reference8 articles.
1. Gould, R., Shull, W.: On spanning trees with few branch vertices. Discrete Math. 343, 111581 (2020)
2. Ha, P.H., Hanh, D.D., Loan, N.T.: Spanning trees with few peripheral branch vertices. Taiwan. J. Math. 25, 435–447 (2021a)
3. Ha, P.H., Hanh, D.D., Loan, N.T., Pham, N.D.: Spanning trees with whose reducible stems have a few branch vertices. Czech. Math. J. 71(146), 697–708 (2021b)
4. Kano, M., Yan, Z.: Spanning trees whose stems have at most k leaves. Ars Combin CXIVII, 417–424 (2014)
5. Maezawa, S., Matsubara, R., Matsuda, H.: Degree conditions for graphs to have spanning trees with few branch vertices and leaves. Graphs Combin. 35, 231–238 (2019)