{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,2]],"date-time":"2022-04-02T02:32:17Z","timestamp":1648866737703},"reference-count":6,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2013,4,19]],"date-time":"2013-04-19T00:00:00Z","timestamp":1366329600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/2.0"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2014,7]]},"DOI":"10.1007\/s00373-013-1314-z","type":"journal-article","created":{"date-parts":[[2013,4,18]],"date-time":"2013-04-18T13:04:01Z","timestamp":1366290241000},"page":"957-962","source":"Crossref","is-referenced-by-count":2,"title":["Closure and Spanning k-Trees"],"prefix":"10.1007","volume":"30","author":[{"given":"Ryota","family":"Matsubara","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Masao","family":"Tsugaki","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":[[2013,4,19]]},"reference":[{"key":"1314_CR1","unstructured":"Bondy, J.A.: Basic Graph Theory\u2014Paths and Circuits. Handbook of Combinatorics, vol. I, pp. 5\u2013110. Elsevier, Amsterdam (1995)"},{"key":"1314_CR2","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1016\/0012-365X(76)90078-9","volume":"15","author":"J.A. Bondy","year":"1976","unstructured":"Bondy J.A., Chv\u00e1tal V.: A method in graph theory. Discret. Math 15, 111\u2013135 (1976)","journal-title":"Discret. Math"},{"key":"1314_CR3","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1007\/s003730050002","volume":"16","author":"H.J. Broersma","year":"2000","unstructured":"Broersma H.J., Ryj\u00e1\u010dek Z., Schiermeyer I.: Closure concepts: a survey. Graph. Combin. 16, 17\u201348 (2000)","journal-title":"Graph. Combin."},{"key":"1314_CR4","unstructured":"Kano, M., Kishimoto, H.: Spanning k-tree of n-connected graphs. Graph. Combin (2013, to appear)"},{"key":"1314_CR5","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":"1314_CR6","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"}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00373-013-1314-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-013-1314-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-013-1314-z","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,26]],"date-time":"2019-02-26T19:13:59Z","timestamp":1551208439000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00373-013-1314-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,4,19]]},"references-count":6,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2014,7]]}},"alternative-id":["1314"],"URL":"https:\/\/doi.org\/10.1007\/s00373-013-1314-z","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,4,19]]}}}