{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,29]],"date-time":"2026-04-29T02:30:29Z","timestamp":1777429829248,"version":"3.51.4"},"reference-count":5,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2007,10,1]],"date-time":"2007-10-01T00:00:00Z","timestamp":1191196800000},"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":[[2007,10]]},"DOI":"10.1007\/s00373-007-0751-y","type":"journal-article","created":{"date-parts":[[2007,10,15]],"date-time":"2007-10-15T05:06:58Z","timestamp":1192424818000},"page":"585-598","source":"Crossref","is-referenced-by-count":12,"title":["Spanning Trees with Few Leaves"],"prefix":"10.1007","volume":"23","author":[{"given":"Masao","family":"Tsugaki","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tomoki","family":"Yamashita","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"751_CR1","unstructured":"Bondy, J.A.: Basic Graph Theory: Paths and Circuits, in: Handbook of Combinatorics, Vol. I, Graham, R., Gr\u0151tshel, M., and Lov\u00e1sz, L. (eds), Elsevier, Amsterdam 1995, pp. 5\u2013110"},{"key":"751_CR2","doi-asserted-by":"crossref","unstructured":"Broersma, H., Tuinstra, H.: Independence trees and Hamilton cycles. J. Graph Theory 29, 227\u2013237 (1998)","DOI":"10.1002\/(SICI)1097-0118(199812)29:4<227::AID-JGT2>3.0.CO;2-W"},{"key":"751_CR3","unstructured":"Chv\u00e1tal, V., Erd\u0151s, P.: A note on hamiltonian circuits, Discrete Math. 2, 111\u2013113 (1972)"},{"key":"751_CR4","doi-asserted-by":"crossref","unstructured":"Ore, O.: Note on Hamilton circuits, Am. Math. Monthly 67, 55 (1960)","DOI":"10.2307\/2308928"},{"key":"751_CR5","unstructured":"Win, S.: On a conjecture of Las Vergnas concerning certain spanning trees in graphs, Resultate Math. 2, 215\u2013224 (1979)"}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-007-0751-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00373-007-0751-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-007-0751-y","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,28]],"date-time":"2019-05-28T10:58:27Z","timestamp":1559041107000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00373-007-0751-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,10]]},"references-count":5,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2007,10]]}},"alternative-id":["751"],"URL":"https:\/\/doi.org\/10.1007\/s00373-007-0751-y","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007,10]]}}}