{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,16]],"date-time":"2026-06-16T23:11:01Z","timestamp":1781651461305,"version":"3.54.5"},"reference-count":7,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2006,11,1]],"date-time":"2006-11-01T00:00:00Z","timestamp":1162339200000},"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":[[2006,11]]},"DOI":"10.1007\/s00373-006-0660-5","type":"journal-article","created":{"date-parts":[[2006,11,23]],"date-time":"2006-11-23T11:32:06Z","timestamp":1164281526000},"page":"371-381","source":"Crossref","is-referenced-by-count":12,"title":["On a k-Tree Containing Specified Leaves in a Graph"],"prefix":"10.1007","volume":"22","author":[{"given":"Haruhide","family":"Matsuda","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Hajime","family":"Matsumura","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"660_CR1","unstructured":"Bondy, J.A., Murty, U.S.R.: Graph theory with applications, North Holland, New York, 1981"},{"key":"660_CR2","doi-asserted-by":"crossref","unstructured":"Chv\u00e1tal, V., Erd\u00f6s, P.: A note on Hamilton circuits. Discrete Math. 2, 111\u2013113 (1972)","DOI":"10.1016\/0012-365X(72)90079-9"},{"key":"660_CR3","unstructured":"Hall, P.: On representatives of subsets. J London Math. Soc. 10, 26\u201330 (1935)"},{"key":"660_CR4","doi-asserted-by":"crossref","unstructured":"Neumann-Lara, V., Rivera-Campo, E.: Spanning trees with bounded degrees. Combinatorica 11, 55\u201361 (1991)","DOI":"10.1007\/BF01375473"},{"key":"660_CR5","doi-asserted-by":"crossref","unstructured":"Ore, O.: Notes on Hamilton circuits. Amer. Math. Monthly 67, 55 (1960)","DOI":"10.2307\/2308928"},{"key":"660_CR6","unstructured":"Ore, O.: Hamilton connected graphs. J. Math. Pures Appl. 42, 21\u201327 (1963)"},{"key":"660_CR7","doi-asserted-by":"crossref","unstructured":"Win, S.: Existenz von Ger\u00fcsten mit vorgeschriebenem Maximalgrad in Graphen. Abh Math Seminar Univ Hamburg 43, 263\u2013267 (1975)","DOI":"10.1007\/BF02995957"}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-006-0660-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00373-006-0660-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-006-0660-5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,28]],"date-time":"2019-05-28T10:58:26Z","timestamp":1559041106000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00373-006-0660-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,11]]},"references-count":7,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2006,11]]}},"alternative-id":["660"],"URL":"https:\/\/doi.org\/10.1007\/s00373-006-0660-5","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006,11]]}}}