{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,8,14]],"date-time":"2024-08-14T07:11:51Z","timestamp":1723619511161},"reference-count":21,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2024,2,19]],"date-time":"2024-02-19T00:00:00Z","timestamp":1708300800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,2,19]],"date-time":"2024-02-19T00:00:00Z","timestamp":1708300800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Period Math Hung"],"published-print":{"date-parts":[[2024,9]]},"DOI":"10.1007\/s10998-024-00572-7","type":"journal-article","created":{"date-parts":[[2024,2,19]],"date-time":"2024-02-19T16:07:33Z","timestamp":1708358853000},"page":"61-71","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Spanning trees of $$K_{1,4}$$-free graphs whose reducible stems have few leaves"],"prefix":"10.1007","volume":"89","author":[{"given":"Pham Hoang","family":"Ha","sequence":"first","affiliation":[]},{"given":"Le Dinh","family":"Nam","sequence":"additional","affiliation":[]},{"given":"Ngoc Diep","family":"Pham","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,2,19]]},"reference":[{"key":"572_CR1","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1002\/(SICI)1097-0118(199812)29:4<227::AID-JGT2>3.0.CO;2-W","volume":"29","author":"H Broersma","year":"1998","unstructured":"H. Broersma, H. Tuinstra, Independence trees and Hamilton cycles. J. Graph Theory 29, 227\u2013237 (1998)","journal-title":"J. Graph Theory"},{"key":"572_CR2","first-page":"127842","volume":"445","author":"G Chen","year":"2023","unstructured":"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)","journal-title":"Appl. Math. Comput."},{"key":"572_CR3","doi-asserted-by":"publisher","first-page":"1579","DOI":"10.1007\/s11425-014-4817-z","volume":"57","author":"Y Chen","year":"2014","unstructured":"Y. Chen, G. Chen, Z. Hu, Spanning $$3$$-ended trees in $$k$$-connected $$K_{1,4}$$-free graphs. Sci. China Math. 57, 1579\u20131586 (2014)","journal-title":"Sci. China Math."},{"key":"572_CR4","doi-asserted-by":"publisher","first-page":"2342","DOI":"10.1016\/j.disc.2019.05.005","volume":"342","author":"Y Chen","year":"2019","unstructured":"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\u20132349 (2019)","journal-title":"Discrete Math."},{"key":"572_CR5","volume-title":"Graph Theory","author":"R Diestel","year":"2005","unstructured":"R. Diestel, Graph Theory, 3rd edn. (Springer, Berlin, 2005)","edition":"3"},{"key":"572_CR6","doi-asserted-by":"publisher","first-page":"142","DOI":"10.1016\/j.dam.2021.09.004","volume":"305","author":"PH Ha","year":"2021","unstructured":"P.H. Ha, A note on the independence number, connectivity and $$k$$-ended tree. Discrete Appl. Math. 305, 142\u2013144 (2021)","journal-title":"Discrete Appl. Math."},{"issue":"1","key":"572_CR7","first-page":"2","volume":"60","author":"PH Ha","year":"2023","unstructured":"P.H. Ha, Spanning trees of a claw-free graph whose reducible stems have few leaves. Stud. Sci. Math. Hung. 60(1), 2\u201315 (2023)","journal-title":"Stud. Sci. Math. Hung."},{"key":"572_CR8","doi-asserted-by":"publisher","first-page":"2373","DOI":"10.1007\/s40840-019-00812-x","volume":"43","author":"PH Ha","year":"2020","unstructured":"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\u20132383 (2020)","journal-title":"Bull. Malays. Math. Sci. Soc."},{"issue":"3","key":"572_CR9","doi-asserted-by":"publisher","first-page":"435","DOI":"10.11650\/tjm\/201201","volume":"25","author":"PH Ha","year":"2021","unstructured":"P.H. Ha, D.D. Hanh, N.T. Loan, Spanning trees with few peripheral branch vertices. Taiwan. J. Math. 25(3), 435\u2013447 (2021)","journal-title":"Taiwan. J. Math."},{"issue":"146","key":"572_CR10","doi-asserted-by":"publisher","first-page":"697","DOI":"10.21136\/CMJ.2021.0073-20","volume":"71","author":"PH Ha","year":"2021","unstructured":"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\u2013708 (2021)","journal-title":"Czech Math J."},{"issue":"1","key":"572_CR11","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10474-023-01295-w","volume":"169","author":"DD Hanh","year":"2023","unstructured":"D.D. Hanh, Spanning trees with few peripheral branch vertices in a connected claw-free graph. Acta Math. Hung. 169(1), 1\u201314 (2023)","journal-title":"Acta Math. Hung."},{"key":"572_CR12","first-page":"137","volume":"103","author":"M Kano","year":"2012","unstructured":"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\u2013154 (2012)","journal-title":"Ars Combin."},{"key":"572_CR13","first-page":"417","volume":"117","author":"M Kano","year":"2014","unstructured":"M. Kano, Z. Yan, Spanning trees whose stems have at most $$k$$ leaves. Ars Combin. 117, 417\u2013424 (2014)","journal-title":"Ars Combin."},{"key":"572_CR14","first-page":"1883","volume":"31","author":"M Kano","year":"2015","unstructured":"M. Kano, Z. Yan, Spanning trees whose stems are spiders. Ars Combin. 31, 1883\u20131887 (2015)","journal-title":"Ars Combin."},{"key":"572_CR15","doi-asserted-by":"publisher","first-page":"6146","DOI":"10.1016\/j.disc.2009.04.023","volume":"309","author":"A Kyaw","year":"2009","unstructured":"A. Kyaw, Spanning trees with at most $$3$$ leaves in $$K_{1,4}$$-free graphs. Discrete Math. 309, 6146\u20136148 (2009)","journal-title":"Discrete Math."},{"key":"572_CR16","doi-asserted-by":"publisher","first-page":"2135","DOI":"10.1016\/j.disc.2011.06.025","volume":"311","author":"A Kyaw","year":"2011","unstructured":"A. Kyaw, Spanning trees with at most $$k$$ leaves in $$K_{1,4}$$-free graphs. Discrete Math. 311, 2135\u20132142 (2011)","journal-title":"Discrete Math."},{"key":"572_CR17","first-page":"1297","volume":"272","author":"M Las Vergnas","year":"1971","unstructured":"M. Las Vergnas, Sur une propri\u00e9t\u00e9 des arbres maximaux dans un graphe, C. R. Acad. Sci. Paris Ser. A 272, 1297\u20131300 (1971)","journal-title":"R. Acad. Sci. Paris Ser. A"},{"key":"572_CR18","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1002\/jgt.3190080116","volume":"8","author":"MM Matthews","year":"1984","unstructured":"M.M. Matthews, D.P. Sumner, Hamiltonian results in $$K_{1,3}$$-free graphs. J. Graph Theory 8, 139\u2013146 (1984)","journal-title":"J. Graph Theory"},{"key":"572_CR19","first-page":"245","volume":"114","author":"M Tsugaki","year":"2014","unstructured":"M. Tsugaki, Y. Zhang, Spanning trees whose stems have a few leaves. Ars Combin. 114, 245\u2013256 (2014)","journal-title":"Ars Combin."},{"key":"572_CR20","doi-asserted-by":"publisher","first-page":"773","DOI":"10.7151\/dmgt.1885","volume":"36","author":"Z Yan","year":"2016","unstructured":"Z. Yan, Spanning trees whose stems have a bounded number of branch vertices. Discuss. Math. Graph Theory 36, 773\u2013778 (2016)","journal-title":"Discuss. Math. Graph Theory"},{"key":"572_CR21","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1007\/BF03322958","volume":"2","author":"S Win","year":"1979","unstructured":"S. Win, On a conjecture of Las Vergnas concerning certain spanning trees in graphs. Result. Math. 2, 215\u2013224 (1979)","journal-title":"Result. Math."}],"container-title":["Periodica Mathematica Hungarica"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10998-024-00572-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10998-024-00572-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10998-024-00572-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,8,13]],"date-time":"2024-08-13T09:32:16Z","timestamp":1723541536000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10998-024-00572-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,2,19]]},"references-count":21,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2024,9]]}},"alternative-id":["572"],"URL":"https:\/\/doi.org\/10.1007\/s10998-024-00572-7","relation":{},"ISSN":["0031-5303","1588-2829"],"issn-type":[{"type":"print","value":"0031-5303"},{"type":"electronic","value":"1588-2829"}],"subject":[],"published":{"date-parts":[[2024,2,19]]},"assertion":[{"value":"4 July 2023","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 February 2024","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}