Abstract
Let T be a tree; a vertex of degree 1 is a leaf of T and a vertex of degree at least 3 is a branch vertex of T. The reducible stem of T is the smallest subtree that contains all branch vertices of T. In this paper, we give some sharp sufficient conditions for \(K_{1,4}\)-free graphs to have a spanning tree whose reducible stem has few leaves.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
H. Broersma, H. Tuinstra, Independence trees and Hamilton cycles. J. Graph Theory 29, 227–237 (1998)
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)
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)
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)
R. Diestel, Graph Theory, 3rd edn. (Springer, Berlin, 2005)
P.H. Ha, A note on the independence number, connectivity and \(k\)-ended tree. Discrete Appl. Math. 305, 142–144 (2021)
P.H. Ha, Spanning trees of a claw-free graph whose reducible stems have few leaves. Stud. Sci. Math. Hung. 60(1), 2–15 (2023)
P.H. Ha, D.D. Hanh, Spanning trees of connected \(K_{1, t}\)-free graphs whose stems have a few leaves. Bull. Malays. Math. Sci. Soc. 43, 2373–2383 (2020)
P.H. Ha, D.D. Hanh, N.T. Loan, Spanning trees with few peripheral branch vertices. Taiwan. J. Math. 25(3), 435–447 (2021)
P.H. Ha, D.D. Hanh, N.T. Loan, N.D. Pham, Spanning trees whose reducible stems have a few branch vertices. Czech Math J. 71(146), 697–708 (2021)
D.D. Hanh, Spanning trees with few peripheral branch vertices in a connected claw-free graph. Acta Math. Hung. 169(1), 1–14 (2023)
M. Kano, A. Kyaw, H. Matsuda, K. Ozeki, A. Saito, T. Yamashita, Spanning trees with a bounded number of leaves in a claw-free graph. Ars Combin. 103, 137–154 (2012)
M. Kano, Z. Yan, Spanning trees whose stems have at most \(k\) leaves. Ars Combin. 117, 417–424 (2014)
M. Kano, Z. Yan, Spanning trees whose stems are spiders. Ars Combin. 31, 1883–1887 (2015)
A. Kyaw, Spanning trees with at most \(3\) leaves in \(K_{1,4}\)-free graphs. Discrete Math. 309, 6146–6148 (2009)
A. Kyaw, Spanning trees with at most \(k\) leaves in \(K_{1,4}\)-free graphs. Discrete Math. 311, 2135–2142 (2011)
M. Las Vergnas, Sur une propriété des arbres maximaux dans un graphe, C. R. Acad. Sci. Paris Ser. A 272, 1297–1300 (1971)
M.M. Matthews, D.P. Sumner, Hamiltonian results in \(K_{1,3}\)-free graphs. J. Graph Theory 8, 139–146 (1984)
M. Tsugaki, Y. Zhang, Spanning trees whose stems have a few leaves. Ars Combin. 114, 245–256 (2014)
Z. Yan, Spanning trees whose stems have a bounded number of branch vertices. Discuss. Math. Graph Theory 36, 773–778 (2016)
S. Win, On a conjecture of Las Vergnas concerning certain spanning trees in graphs. Result. Math. 2, 215–224 (1979)
Acknowledgements
We would like to thank the referees for their valuable comments which helped us improve this research.
Author information
Authors and Affiliations
Corresponding author
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
Springer Nature or its licensor (e.g. a society or other partner) holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.
About this article
Cite this article
Ha, P.H., Nam, L.D. & Pham, N.D. Spanning trees of \(K_{1,4}\)-free graphs whose reducible stems have few leaves. Period Math Hung (2024). https://doi.org/10.1007/s10998-024-00572-7
Accepted:
Published:
DOI: https://doi.org/10.1007/s10998-024-00572-7