{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,16]],"date-time":"2025-10-16T00:16:01Z","timestamp":1760573761658,"version":"build-2065373602"},"reference-count":13,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2025,8,26]],"date-time":"2025-08-26T00:00:00Z","timestamp":1756166400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2025,8,26]],"date-time":"2025-08-26T00:00:00Z","timestamp":1756166400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"name":"Office of Research and Sponsored Programs, University of Wisconsin-Eau Claire"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2025,10]]},"DOI":"10.1007\/s00373-025-02945-2","type":"journal-article","created":{"date-parts":[[2025,8,26]],"date-time":"2025-08-26T10:37:53Z","timestamp":1756204673000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Spanning Trees with Few Branch Vertices in a Chair-Free Graph"],"prefix":"10.1007","volume":"41","author":[{"given":"Janee","family":"Schrader","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0009-0003-7952-4607","authenticated-orcid":false,"given":"Warren","family":"Shull","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,8,26]]},"reference":[{"key":"2945_CR1","doi-asserted-by":"publisher","first-page":"695","DOI":"10.1007\/s00373-010-0941-x","volume":"26","author":"J Fujisawa","year":"2010","unstructured":"Fujisawa, J., Matsumura, H., Yamashita, T.: Degree bounded spanning trees. Graphs Comb. 26, 695\u2013720 (2010)","journal-title":"Graphs Comb."},{"key":"2945_CR2","first-page":"259","volume":"108","author":"R Gould","year":"2019","unstructured":"Gould, R., Shull, W.: On a conjecture on spanning trees with few branch vertices. J. Comb. Math. Comb. Comput. 108, 259\u2013283 (2019)","journal-title":"J. Comb. Math. Comb. Comput."},{"key":"2945_CR3","doi-asserted-by":"crossref","unstructured":"Gould, R., Shull, W.: On spanning trees with few branch vertices. Discrete Math. 343(1), 111581, 7 (2020)","DOI":"10.1016\/j.disc.2019.06.037"},{"key":"2945_CR4","doi-asserted-by":"crossref","unstructured":"Hanh, D.D.: A condition ensuring that a connected graph has a spanning tree with few leaves. Eur. J. Math. 9(2), 10. Paper No. 26 (2023)","DOI":"10.1007\/s40879-023-00624-1"},{"key":"2945_CR5","first-page":"58","volume":"59","author":"DD Hanh","year":"2022","unstructured":"Hanh, D.D.: Degree conditions for claw-free graphs to have spanning trees with at most five branch vertices and leaves in total. Studia Sci. Math. Hungar. 59, 58\u201366 (2022)","journal-title":"Studia Sci. Math. Hungar."},{"key":"2945_CR6","first-page":"137","volume":"103","author":"M Kano","year":"2012","unstructured":"Kano, M., Kyaw, A., Matsuda, H., Ozeki, K., Saito, A., Yamashita, T.: Spanning trees with small number of leaves in a claw-free graph. Ars Combin. 103, 137\u2013154 (2012)","journal-title":"Ars Combin."},{"key":"2945_CR7","first-page":"3","volume":"37","author":"A Kyaw","year":"2007","unstructured":"Kyaw, A.: A sufficient condition for spanning trees with bounded maximum degree in a graph. Australas. J. Comb. 37, 3\u201310 (2007)","journal-title":"Australas. J. Comb."},{"key":"2945_CR8","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1007\/s00373-018-1998-1","volume":"35","author":"S Maezawa","year":"2019","unstructured":"Maezawa, S., Matsubara, R., Matsuda, H.: Degree conditions for graphs to have spanning trees with few branch vertices and leaves. Graphs Combin. 35, 231\u2013238 (2019)","journal-title":"Graphs Combin."},{"key":"2945_CR9","doi-asserted-by":"publisher","first-page":"371","DOI":"10.1007\/s00373-006-0660-5","volume":"22","author":"H Matsuda","year":"2006","unstructured":"Matsuda, H., Matsumura, H.: On a k-tree containing specified leaves in a graph. Graphs Comb. 22, 371\u2013381 (2006)","journal-title":"Graphs Comb."},{"key":"2945_CR10","doi-asserted-by":"publisher","first-page":"429","DOI":"10.1007\/s00373-012-1277-5","volume":"30","author":"H Matsuda","year":"2014","unstructured":"Matsuda, H., Ozeki, K., Yamashita, T.: Spanning trees with a bounded number of branch vertices in a claw-free graph. Graphs Comb. 30, 429\u2013437 (2014)","journal-title":"Graphs Comb."},{"key":"2945_CR11","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1007\/BF01375473","volume":"11","author":"V Neumann-Lara","year":"1991","unstructured":"Neumann-Lara, V., Rivera-Campo, E.: Spanning trees with bounded degrees. Combinatorica 11, 55\u201361 (1991)","journal-title":"Combinatorica"},{"key":"2945_CR12","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s00373-010-0973-2","volume":"27","author":"K Ozeki","year":"2011","unstructured":"Ozeki, K., Yamashita, T.: Spanning trees: a survey. Graphs Comb. 27, 1\u201326 (2011)","journal-title":"Graphs Comb."},{"key":"2945_CR13","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1007\/BF02995957","volume":"43","author":"S Win","year":"1975","unstructured":"Win, S.: Existenz von Ger\u00fcsten mit vorgeschriebenem Maximalgrad in Graphen (German). Abh. Math. Sem. Univ. Hamburg 43, 263\u2013267 (1975)","journal-title":"Abh. Math. Sem. Univ. Hamburg"}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-025-02945-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00373-025-02945-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-025-02945-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,15]],"date-time":"2025-10-15T05:11:21Z","timestamp":1760505081000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00373-025-02945-2"}},"subtitle":["Independence Number and Degree Sum Conditions"],"short-title":[],"issued":{"date-parts":[[2025,8,26]]},"references-count":13,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2025,10]]}},"alternative-id":["2945"],"URL":"https:\/\/doi.org\/10.1007\/s00373-025-02945-2","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"type":"print","value":"0911-0119"},{"type":"electronic","value":"1435-5914"}],"subject":[],"published":{"date-parts":[[2025,8,26]]},"assertion":[{"value":"31 March 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"12 June 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"26 August 2025","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare that they have no Conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"97"}}