{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,4]],"date-time":"2022-04-04T23:38:15Z","timestamp":1649115495977},"reference-count":3,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2010,4,27]],"date-time":"2010-04-27T00:00:00Z","timestamp":1272326400000},"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,7]]},"DOI":"10.1007\/s00373-010-0933-x","type":"journal-article","created":{"date-parts":[[2010,4,26]],"date-time":"2010-04-26T04:01:15Z","timestamp":1272254475000},"page":"591-596","source":"Crossref","is-referenced-by-count":3,"title":["A Spanning Tree with High Degree Vertices"],"prefix":"10.1007","volume":"26","author":[{"given":"Kenta","family":"Ozeki","sequence":"first","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,27]]},"reference":[{"key":"933_CR1","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1016\/S0012-365X(96)00306-8","volume":"170","author":"T. B\u00f6hme","year":"1997","unstructured":"B\u00f6hme T., Broersma H.J., G\u00f6bel F., Kostochka A.V., Stiebitz M.: Spanning trees with pairwise nonadjacent endvertices. Discret. Math. 170, 219\u2013222 (1997)","journal-title":"Discret. Math."},{"key":"933_CR2","first-page":"353","volume":"18","author":"A. Frank","year":"1976","unstructured":"Frank A., Gy\u00e1rf\u00e1s, A.: How to orient the edges of a graph? Colloq. Math. Soc. J\u00e0nos Bolyai 18, 353\u2013364 (1976)","journal-title":"Colloq. Math. Soc. J\u00e0nos Bolyai"},{"key":"933_CR3","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1016\/S0020-0190(00)00018-1","volume":"73","author":"A. Kaneko","year":"2000","unstructured":"Kaneko A., Yoshimoto K.: On spanning trees with restricted degrees. Inf. Process. Lett. 73, 163\u2013165 (2000)","journal-title":"Inf. Process. Lett."}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-010-0933-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00373-010-0933-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-0933-x","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,28]],"date-time":"2019-05-28T14:58:30Z","timestamp":1559055510000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00373-010-0933-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,4,27]]},"references-count":3,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2010,7]]}},"alternative-id":["933"],"URL":"https:\/\/doi.org\/10.1007\/s00373-010-0933-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,27]]}}}