{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,15]],"date-time":"2025-10-15T10:06:20Z","timestamp":1760522780957},"reference-count":15,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2010,4,14]],"date-time":"2010-04-14T00:00:00Z","timestamp":1271203200000},"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":[[2010,9]]},"DOI":"10.1007\/s00373-010-0941-x","type":"journal-article","created":{"date-parts":[[2010,4,13]],"date-time":"2010-04-13T15:47:51Z","timestamp":1271173671000},"page":"695-720","source":"Crossref","is-referenced-by-count":6,"title":["Degree Bounded Spanning Trees"],"prefix":"10.1007","volume":"26","author":[{"given":"Jun","family":"Fujisawa","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hajime","family":"Matsumura","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":[[2010,4,14]]},"reference":[{"key":"941_CR1","unstructured":"Bondy, J.A.: Longest paths and cycles in graphs with high degree, Research Report CORR 80\u201316. University of Waterloo, Waterloo (1980)"},{"key":"941_CR2","unstructured":"Bondy, J.A.: Integrity in graph theory, The Theory and Applications of Graphs, pp. 117\u2013125. Wiley, New York (1981)"},{"key":"941_CR3","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-349-03521-2","volume-title":"Graph Theory with Applications","author":"J.A. Bondy","year":"1976","unstructured":"Bondy J.A., Murty U.S.R.: Graph Theory with Applications. Macmillan, Elsevier, London, New York (1976)"},{"key":"941_CR4","doi-asserted-by":"crossref","first-page":"7","DOI":"10.1002\/jgt.3190150103","volume":"15","author":"Y. Caro","year":"1991","unstructured":"Caro Y., Krasikov I., Roddity Y.: On the largest tree of given maximum degree in a connected graph. J. Graph Theory 15, 7\u201313 (1991)","journal-title":"J. Graph Theory"},{"key":"941_CR5","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1016\/0012-365X(72)90079-9","volume":"2","author":"V. Chv\u00e1tal","year":"1972","unstructured":"Chv\u00e1tal V., Erd\u0151s P.: A note on Hamilton circuits. Discrete Math. 2, 111\u2013113 (1972)","journal-title":"Discrete Math."},{"key":"941_CR6","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1002\/(SICI)1097-0118(200003)33:3<125::AID-JGT1>3.0.CO;2-X","volume":"33","author":"M.N. Ellingham","year":"2000","unstructured":"Ellingham M.N., Zha X.: Toughness, trees and walks. J. Graph Theory 33, 125\u2013137 (2000)","journal-title":"J. Graph Theory"},{"key":"941_CR7","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1007\/s003730170059","volume":"17","author":"A. Kyaw","year":"2001","unstructured":"Kyaw A.: A sufficient condition for a graph to have a k-tree. Graphs Combin. 17, 113\u2013121 (2001)","journal-title":"Graphs Combin."},{"key":"941_CR8","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":"941_CR9","doi-asserted-by":"crossref","first-page":"55","DOI":"10.2307\/2308928","volume":"67","author":"O. Ore","year":"1960","unstructured":"Ore O.: Note on Hamilton circuits. Amer. Math. Monthly 67, 55 (1960)","journal-title":"Amer. Math. Monthly"},{"key":"941_CR10","first-page":"19","volume":"90","author":"E. Rivera-Campo","year":"1992","unstructured":"Rivera-Campo E.: An Ore-type condition for the existence of spanning trees with bounded degrees. Congr. Numer. 90, 19\u201332 (1992)","journal-title":"Congr. Numer."},{"key":"941_CR11","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1007\/s00493-009-2349-x","volume":"29","author":"M. Tsugaki","year":"2009","unstructured":"Tsugaki M.: A note on a spanning 3-tree. Combinatorica 29, 127\u2013129 (2009)","journal-title":"Combinatorica"},{"key":"941_CR12","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":"941_CR13","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. Abh. Math. Sem. Univ. Hamburg 43, 263\u2013267 (1975)","journal-title":"Abh. Math. Sem. Univ. Hamburg"},{"key":"941_CR14","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1007\/BF01788671","volume":"5","author":"S. Win","year":"1989","unstructured":"Win S.: On a connection between the existence of k-trees and the toughness of a graph. Graphs Combin. 5, 201\u2013205 (1989)","journal-title":"Graphs Combin."},{"key":"941_CR15","doi-asserted-by":"crossref","first-page":"6584","DOI":"10.1016\/j.disc.2007.10.048","volume":"308","author":"T. Yamashita","year":"2008","unstructured":"Yamashita T.: On degree sum conditions for long cycles and cycles through specified vertices. Discrete Math. 308, 6584\u20136587 (2008)","journal-title":"Discrete Math."}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-010-0941-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00373-010-0941-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-010-0941-x","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,28]],"date-time":"2019-05-28T14:58:31Z","timestamp":1559055511000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00373-010-0941-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,4,14]]},"references-count":15,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2010,9]]}},"alternative-id":["941"],"URL":"https:\/\/doi.org\/10.1007\/s00373-010-0941-x","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,4,14]]}}}