{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,10,6]],"date-time":"2023-10-06T09:58:53Z","timestamp":1696586333458},"reference-count":3,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2014,1,30]],"date-time":"2014-01-30T00:00:00Z","timestamp":1391040000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Combinatorica"],"published-print":{"date-parts":[[2014,2]]},"DOI":"10.1007\/s00493-014-2576-7","type":"journal-article","created":{"date-parts":[[2014,1,30]],"date-time":"2014-01-30T02:52:45Z","timestamp":1391050365000},"page":"47-60","source":"Crossref","is-referenced-by-count":2,"title":["A necessary and sufficient condition for the existence of a spanning tree with specified vertices having large degrees"],"prefix":"10.1007","volume":"34","author":[{"given":"Yoshimi","family":"Egawa","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kenta","family":"Ozeki","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2014,1,30]]},"reference":[{"key":"2576_CR1","first-page":"353","volume":"18","author":"A Frank","year":"1976","unstructured":"A. Frank and A. Gy\u00e1rf\u00e1s: How to orient the edges of a graph? Colloq. Math. Soc. J\u00e1nos Bolyai 18 (1976), 353\u2013364.","journal-title":"Colloq. Math. Soc. J\u00e1nos Bolyai"},{"key":"2576_CR2","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1016\/S0020-0190(00)00018-1","volume":"73","author":"A Kaneko","year":"2000","unstructured":"A. Kaneko and K. Yoshimoto: On spanning trees with restricted degrees, Inform. Process. Lett. 73 (2000), 163\u2013165.","journal-title":"Inform. Process. Lett."},{"key":"2576_CR3","volume-title":"Combinatorial Optimization","author":"A Schrijver","year":"2003","unstructured":"A. Schrijver: Combinatorial Optimization, Springer, 2003."}],"container-title":["Combinatorica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00493-014-2576-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00493-014-2576-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00493-014-2576-7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,28]],"date-time":"2019-05-28T21:32:49Z","timestamp":1559079169000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00493-014-2576-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,1,30]]},"references-count":3,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2014,2]]}},"alternative-id":["2576"],"URL":"https:\/\/doi.org\/10.1007\/s00493-014-2576-7","relation":{},"ISSN":["0209-9683","1439-6912"],"issn-type":[{"value":"0209-9683","type":"print"},{"value":"1439-6912","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,1,30]]}}}