{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:35:57Z","timestamp":1759638957120},"reference-count":7,"publisher":"Elsevier BV","issue":"4","license":[{"start":{"date-parts":[[1979,4,1]],"date-time":"1979-04-01T00:00:00Z","timestamp":291772800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information Processing Letters"],"published-print":{"date-parts":[[1979,4]]},"DOI":"10.1016\/0020-0190(79)90026-7","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T04:11:21Z","timestamp":1027656681000},"page":"207-214","source":"Crossref","is-referenced-by-count":10,"title":["F-factors of graphs: A generalized matching problem"],"prefix":"10.1016","volume":"8","author":[{"given":"Jo\u00a8rg","family":"Mu\u00a8hlbacher","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0020-0190(79)90026-7_bib1","series-title":"Graphs and Hypergraphs","author":"Berge","year":"1973"},{"key":"10.1016\/0020-0190(79)90026-7_bib2","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1007\/BF02246734","article-title":"Bestimmung eines maximalen Matching in beliebigen Graphen","volume":"9","author":"Do\u02dbrfler","year":"1972","journal-title":"Computing"},{"key":"10.1016\/0020-0190(79)90026-7_bib3","doi-asserted-by":"crossref","first-page":"389","DOI":"10.1007\/BF02241727","article-title":"Ein verbesserter Matching-Algorithmus","volume":"13","author":"Do\u02dbrfler","year":"1974","journal-title":"Computing"},{"key":"10.1016\/0020-0190(79)90026-7_bib4","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1145\/321941.321942","article-title":"An efficient implementation of Edmonds' algorithm for maximum matching on graphs","volume":"23","author":"Gabow","year":"1976","journal-title":"J. ACM"},{"key":"10.1016\/0020-0190(79)90026-7_bib5","article-title":"Magische Quadrate und ihre Verallgemeinerung: ein graphentheoretisches Problem","volume":"13","author":"Mu\u00a8hlbacher","year":"1978","journal-title":"Graphs, Datastructures, Algorithms, Appl. Comp. Sci."},{"key":"10.1016\/0020-0190(79)90026-7_bib6","unstructured":"D. Ko\u02dbnig, Theorie der endlichen und unendlichen Graphen (Chelsea Publ. Comp., London) reprint."},{"key":"10.1016\/0020-0190(79)90026-7_bib7","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1007\/BF02392606","article-title":"Die Theorie der regula\u00a8ren Graphen","volume":"15","author":"Petersen","year":"1891","journal-title":"Acta Math."}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019079900267?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019079900267?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,12]],"date-time":"2019-04-12T16:28:49Z","timestamp":1555086529000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0020019079900267"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1979,4]]},"references-count":7,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1979,4]]}},"alternative-id":["0020019079900267"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(79)90026-7","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1979,4]]}}}