{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,18]],"date-time":"2026-01-18T15:30:21Z","timestamp":1768750221311,"version":"3.49.0"},"reference-count":13,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2012,12,30]],"date-time":"2012-12-30T00:00:00Z","timestamp":1356825600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2014,3]]},"DOI":"10.1007\/s00373-012-1277-5","type":"journal-article","created":{"date-parts":[[2012,12,29]],"date-time":"2012-12-29T02:13:37Z","timestamp":1356747217000},"page":"429-437","source":"Crossref","is-referenced-by-count":19,"title":["Spanning Trees with a Bounded Number of Branch Vertices in a Claw-Free Graph"],"prefix":"10.1007","volume":"30","author":[{"given":"Haruhide","family":"Matsuda","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kenta","family":"Ozeki","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tomoki","family":"Yamashita","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2012,12,30]]},"reference":[{"key":"1277_CR1","doi-asserted-by":"crossref","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":"Broersma H., Tuinstra H.: Independence trees and Hamilton cycles. J. Graph Theory 29, 227\u2013237 (1998)","journal-title":"J. Graph Theory"},{"key":"1277_CR2","doi-asserted-by":"crossref","first-page":"2343","DOI":"10.1016\/j.disc.2007.04.071","volume":"308","author":"E. Flandrin","year":"2008","unstructured":"Flandrin E., Kaiser T., Ku\u017eel R., Li H., Ryj\u00e1\u010dek Z.: Neighborhood unions and extremal spanning trees. Discret. Math. 308, 2343\u20132350 (2008)","journal-title":"Discret. Math."},{"key":"1277_CR3","doi-asserted-by":"crossref","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 Combin. 26, 695\u2013720 (2010)","journal-title":"Graphs Combin."},{"key":"1277_CR4","doi-asserted-by":"crossref","first-page":"802","DOI":"10.1007\/3-540-45061-0_63","volume":"2719","author":"L. Gargano","year":"2003","unstructured":"Gargano L., Hammar M.: There are spanning spiders in dense graphs (and we know how to find them). Lect. Notes Comput. Sci. 2719, 802\u2013816 (2003)","journal-title":"Lect. Notes Comput. Sci."},{"key":"1277_CR5","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1016\/j.disc.2004.04.005","volume":"285","author":"L. Gargano","year":"2004","unstructured":"Gargano L., Hammar M., Hell P., Stacho L., Vaccaro U.: Spanning spiders and light-splitting switches. Discret. Math. 285, 83\u201395 (2004)","journal-title":"Discret. Math."},{"key":"1277_CR6","doi-asserted-by":"crossref","first-page":"355","DOI":"10.1007\/3-540-45465-9_31","volume":"2380","author":"L. Gargano","year":"2002","unstructured":"Gargano L., Hell P., Stacho L., Vaccaro U.: Spanning trees with bounded number of branch vertices. Lect. Notes Comput. Sci. 2380, 355\u2013365 (2002)","journal-title":"Lect. Notes Comput. Sci."},{"key":"1277_CR7","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":"1277_CR8","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1002\/jgt.3190090208","volume":"9","author":"M.M. Matthews","year":"1985","unstructured":"Matthews M.M., Sumner D.P.: Longest paths and cycles in K 1,3-free graphs. J. Graph Theory 9, 269\u2013277 (1985)","journal-title":"J. Graph Theory"},{"key":"1277_CR9","doi-asserted-by":"crossref","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 and Combin 22, 371\u2013381 (2006)","journal-title":"Graphs and Combin"},{"key":"1277_CR10","doi-asserted-by":"crossref","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":"1277_CR11","doi-asserted-by":"crossref","first-page":"585","DOI":"10.1007\/s00373-007-0751-y","volume":"23","author":"M. Tsugaki","year":"2007","unstructured":"Tsugaki M., Yamashita T.: Spanning trees with few leaves. Graphs Combin. 23, 585\u2013598 (2007)","journal-title":"Graphs Combin."},{"key":"1277_CR12","doi-asserted-by":"crossref","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"},{"key":"1277_CR13","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1007\/BF03322958","volume":"2","author":"S. Win","year":"1979","unstructured":"Win S.: On a conjecture of Las Vergnas concerning certain spanning trees in graphs. Result. Math. 2, 215\u2013224 (1979)","journal-title":"Result. Math."}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-012-1277-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00373-012-1277-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-012-1277-5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,28]],"date-time":"2019-05-28T10:59:35Z","timestamp":1559041175000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00373-012-1277-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,12,30]]},"references-count":13,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2014,3]]}},"alternative-id":["1277"],"URL":"https:\/\/doi.org\/10.1007\/s00373-012-1277-5","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,12,30]]}}}