Author:
Ha Pham Hoang,Nam Le Dinh,Pham Ngoc Diep
Publisher
Springer Science and Business Media LLC
Reference21 articles.
1. H. Broersma, H. Tuinstra, Independence trees and Hamilton cycles. J. Graph Theory 29, 227–237 (1998)
2. G. Chen, Y. Chen, Z. Hu, S. Zhang, Spanning trees with at most $$k $$ leaves in 2-connected $$K_{1, r}$$-free graphs. Appl. Math. Comput. 445, 127842 (2023)
3. Y. Chen, G. Chen, Z. Hu, Spanning $$3$$-ended trees in $$k$$-connected $$K_{1,4}$$-free graphs. Sci. China Math. 57, 1579–1586 (2014)
4. Y. Chen, P.H. Ha, D.D. Hanh, Spanning trees with at most 4 leaves in $$K_{1,5}$$-free graphs. Discrete Math. 342, 2342–2349 (2019)
5. R. Diestel, Graph Theory, 3rd edn. (Springer, Berlin, 2005)