{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,2]],"date-time":"2022-04-02T14:14:13Z","timestamp":1648908853976},"reference-count":6,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1981,1,1]],"date-time":"1981-01-01T00:00:00Z","timestamp":347155200000},"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":11885,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Mathematics"],"published-print":{"date-parts":[[1981]]},"DOI":"10.1016\/0012-365x(81)90269-7","type":"journal-article","created":{"date-parts":[[2002,10,8]],"date-time":"2002-10-08T11:17:01Z","timestamp":1034075821000},"page":"259-266","source":"Crossref","is-referenced-by-count":1,"title":["Defect-d matchings in graphs with cyclomatic numbers 0, 1 and 2"],"prefix":"10.1016","volume":"33","author":[{"given":"E.J.","family":"Farrell","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0012-365X(81)90269-7_BIB1","first-page":"258","article-title":"Sur le couplage maximum d'un graphe","volume":"247","author":"Berge","year":"1958","journal-title":"C.R. Acad. Sci. Paris"},{"key":"10.1016\/0012-365X(81)90269-7_BIB2","series-title":"Graphs and Hypergraphs","author":"Berge","year":"1973"},{"key":"10.1016\/0012-365X(81)90269-7_BIB3","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1016\/0095-8956(79)90070-4","article-title":"An introduction to matching polynomials","volume":"27","author":"Farrell","year":"1979","journal-title":"J. Combinatorial Theory (B)"},{"key":"10.1016\/0012-365X(81)90269-7_BIB4","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1063\/1.1703953","article-title":"Dimer statistics and phase transitions","volume":"4","author":"Kasteleyn","year":"1963","journal-title":"J. Math. Physics"},{"key":"10.1016\/0012-365X(81)90269-7_BIB5","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1016\/0012-365X(75)90085-0","article-title":"On defect-d matchings in graphs","volume":"13","author":"Little","year":"1975","journal-title":"Discrete Math."},{"key":"10.1016\/0012-365X(81)90269-7_BIB6","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1016\/0012-365X(72)90083-0","article-title":"The parity of the number of 1-factors of a graph","volume":"2","author":"Little","year":"1972","journal-title":"Discrete Math."}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X81902697?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X81902697?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,10]],"date-time":"2019-04-10T08:21:49Z","timestamp":1554884509000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0012365X81902697"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1981]]},"references-count":6,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1981]]}},"alternative-id":["0012365X81902697"],"URL":"https:\/\/doi.org\/10.1016\/0012-365x(81)90269-7","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[1981]]}}}