{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T14:40:12Z","timestamp":1775054412225,"version":"3.50.1"},"reference-count":4,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2016,6,6]],"date-time":"2016-06-06T00:00:00Z","timestamp":1465171200000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"name":"JSPS KAKENHI","award":["25400187"],"award-info":[{"award-number":["25400187"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2016,11]]},"DOI":"10.1007\/s00373-016-1699-6","type":"journal-article","created":{"date-parts":[[2016,6,6]],"date-time":"2016-06-06T08:08:25Z","timestamp":1465200505000},"page":"2315-2322","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":9,"title":["Generalizations of Marriage Theorem for Degree Factors"],"prefix":"10.1007","volume":"32","author":[{"given":"Rados\u0142aw","family":"Cymer","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mikio","family":"Kano","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,6,6]]},"reference":[{"key":"1699_CR1","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-21919-1","volume-title":"Factors and Factorizations of Graphs, LNM 2031","author":"J Akiyama","year":"2011","unstructured":"Akiyama, J., Kano, M.: Factors and Factorizations of Graphs, LNM 2031. Springer, New York (2011)"},{"key":"1699_CR2","doi-asserted-by":"crossref","first-page":"30","DOI":"10.1016\/S0021-9800(70)80006-0","volume":"8","author":"J Folkman","year":"1970","unstructured":"Folkman, J., Fulkerson, D.R.: Flows in infinite graphs. J. Comb. Theory 8, 30\u201344 (1970)","journal-title":"J. Comb. Theory"},{"key":"1699_CR3","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1090\/S0002-9947-1957-0083725-9","volume":"84","author":"O Ore","year":"1957","unstructured":"Ore, O.: Graphs and subgraphs. Trans. Am. Math. Soc. 84, 109\u2013136 (1957)","journal-title":"Trans. Am. Math. Soc."},{"key":"1699_CR4","doi-asserted-by":"crossref","first-page":"383","DOI":"10.2307\/1970010","volume":"63","author":"O Ore","year":"1956","unstructured":"Ore, O.: Studies on directed graphs I. Ann. Math. 63, 383\u2013406 (1956)","journal-title":"Ann. Math."}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-016-1699-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00373-016-1699-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-016-1699-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,24]],"date-time":"2017-06-24T11:48:22Z","timestamp":1498304902000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00373-016-1699-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,6,6]]},"references-count":4,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2016,11]]}},"alternative-id":["1699"],"URL":"https:\/\/doi.org\/10.1007\/s00373-016-1699-6","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,6,6]]}}}