{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,9,13]],"date-time":"2023-09-13T17:16:03Z","timestamp":1694625363024},"reference-count":5,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2005,12,1]],"date-time":"2005-12-01T00:00:00Z","timestamp":1133395200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2005,12,1]],"date-time":"2005-12-01T00:00:00Z","timestamp":1133395200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2005,12]]},"DOI":"10.1007\/s00373-005-0631-2","type":"journal-article","created":{"date-parts":[[2006,1,30]],"date-time":"2006-01-30T11:48:23Z","timestamp":1138621703000},"page":"421-425","source":"Crossref","is-referenced-by-count":1,"title":["Structural Remarks on Bipartite Graphs with Unique f-Factors"],"prefix":"10.1007","volume":"21","author":[{"given":"Arne","family":"Hoffmann","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lutz","family":"Volkmann","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"631_CR1","unstructured":"Chartrand, G., Lesniak, L.: Graphs and Digraphs 3rd edition. Chapman and Hall, London 1996"},{"key":"631_CR2","unstructured":"Hoffmann, A., Sidorowicz, E., Volkmann, L.: Extremal bipartite graphs with a unique k-factor, submitted"},{"key":"631_CR3","doi-asserted-by":"crossref","first-page":"577","DOI":"10.1002\/jgt.3190130507","volume":"9","author":"B. Jackson","year":"1989","unstructured":"Jackson, B., Whitty, R.W.: A note concerning graphs with unique f-factors. J. Graph Theory 9 577\u2013580 (1989)","journal-title":"J. Graph Theory"},{"key":"631_CR4","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1002\/1097-0118(200012)35:4<227::AID-JGT1>3.0.CO;2-D","volume":"35","author":"P. Johann","year":"2000","unstructured":"Johann, P., On the structure of graphs with a unique k-factor. J. Graph Theory 35 227\u2013243 (2000)","journal-title":"J. Graph Theory"},{"key":"631_CR5","doi-asserted-by":"crossref","first-page":"531","DOI":"10.1007\/s00493-004-0032-9","volume":"24","author":"L. Volkmann","year":"2004","unstructured":"Volkmann, L.: The maximum size of graphs with a unique k-factor. Combinatorica 24 531\u2013540 (2004)","journal-title":"Combinatorica"}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-005-0631-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00373-005-0631-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-005-0631-2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-005-0631-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,14]],"date-time":"2022-05-14T04:02:30Z","timestamp":1652500950000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00373-005-0631-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005,12]]},"references-count":5,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2005,12]]}},"alternative-id":["631"],"URL":"https:\/\/doi.org\/10.1007\/s00373-005-0631-2","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2005,12]]}}}