{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,3]],"date-time":"2026-07-03T06:29:50Z","timestamp":1783060190533,"version":"3.54.6"},"reference-count":13,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1986,6,1]],"date-time":"1986-06-01T00:00:00Z","timestamp":517968000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":9908,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Combinatorial Theory, Series B"],"published-print":{"date-parts":[[1986,6]]},"DOI":"10.1016\/0095-8956(86)90085-7","type":"journal-article","created":{"date-parts":[[2004,12,21]],"date-time":"2004-12-21T20:35:48Z","timestamp":1103661348000},"page":"285-296","source":"Crossref","is-referenced-by-count":38,"title":["An extension of matching theory"],"prefix":"10.1016","volume":"40","author":[{"given":"G\u00e9rard","family":"Cornu\u00e9jols","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"David","family":"Hartvigsen","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/0095-8956(86)90085-7_BIB1","series-title":"Studies on Graphs and Discrete Programming","first-page":"1","article-title":"Integer and fractional matchings","volume":"11","author":"Balas","year":"1981"},{"key":"10.1016\/0095-8956(86)90085-7_BIB2","first-page":"842","article-title":"Two theorems in graph theory","volume":"43","author":"Berge","year":"1957"},{"key":"10.1016\/0095-8956(86)90085-7_BIB3","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1007\/BF02579340","article-title":"Critical graphs, matchings and tours or a hierarchy of relaxations for the travelling salesman problem","volume":"3","author":"Cornu\u00e9jols","year":"1983","journal-title":"Combinatorica"},{"key":"10.1016\/0095-8956(86)90085-7_BIB4","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1016\/0167-6377(82)90016-5","article-title":"Packing subgraphs in a graph","author":"Cornuejols","year":"1982","journal-title":"Oper. Res. Lett."},{"key":"10.1016\/0095-8956(86)90085-7_BIB5","doi-asserted-by":"crossref","first-page":"449","DOI":"10.4153\/CJM-1965-045-4","article-title":"trees and flowers","volume":"17","author":"Paths","year":"1965","journal-title":"Canad. J. Math."},{"key":"10.1016\/0095-8956(86)90085-7_BIB6","doi-asserted-by":"crossref","first-page":"147","DOI":"10.6028\/jres.069B.016","article-title":"Transversals and matroid partition","volume":"69","author":"Edmonds","year":"1965","journal-title":"J. Res. Nat. Bur. Standards B"},{"key":"10.1016\/0095-8956(86)90085-7_BIB7","doi-asserted-by":"crossref","first-page":"601","DOI":"10.1137\/0212040","article-title":"On the complexity of general graph factor problems","author":"Kirkpatrick","year":"1983","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0095-8956(86)90085-7_BIB8","first-page":"279","article-title":"A note on factor-critical graphs","volume":"7","author":"Lovasz","year":"1972","journal-title":"Studia, Sci. Math. Hungar."},{"key":"10.1016\/0095-8956(86)90085-7_BIB9","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1016\/0020-0190(79)90026-7","article-title":"F-Factors of graphs: A generalized matching problem","volume":"8","author":"Muhlbacher","year":"1979","journal-title":"Inform. Process. Lett"},{"key":"10.1016\/0095-8956(86)90085-7_BIB10","doi-asserted-by":"crossref","first-page":"551","DOI":"10.1002\/net.3230130407","article-title":"Dynamic matchings and quasi-dynamic fractional matchings I and II","volume":"13","author":"Orlin","year":"1983","journal-title":"Networks"},{"key":"10.1016\/0095-8956(86)90085-7_BIB11","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1112\/jlms\/s1-22.2.107","article-title":"The factorization of linear graphs","volume":"22","author":"Tutte","year":"1947","journal-title":"J. London Math. Soc."},{"key":"10.1016\/0095-8956(86)90085-7_BIB12_1","first-page":"V-3","article-title":"Sur le probl\u00e8me du couplage maximal","volume":"9","author":"Uhry","year":"1975","journal-title":"Rairo"},{"key":"10.1016\/0095-8956(86)90085-7_BIB12_2","first-page":"13","article-title":"Sur le probl\u00e8me du couplage maximal","volume":"9","author":"Uhry","year":"1975","journal-title":"Rairo"}],"container-title":["Journal of Combinatorial Theory, Series B"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0095895686900857?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0095895686900857?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,1,30]],"date-time":"2019-01-30T15:52:18Z","timestamp":1548863538000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0095895686900857"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1986,6]]},"references-count":13,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1986,6]]}},"alternative-id":["0095895686900857"],"URL":"https:\/\/doi.org\/10.1016\/0095-8956(86)90085-7","relation":{},"ISSN":["0095-8956"],"issn-type":[{"value":"0095-8956","type":"print"}],"subject":[],"published":{"date-parts":[[1986,6]]}}}