{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,30]],"date-time":"2022-03-30T05:38:27Z","timestamp":1648618707288},"reference-count":8,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[1997,2,1]],"date-time":"1997-02-01T00:00:00Z","timestamp":854755200000},"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":6010,"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":[[1997,2]]},"DOI":"10.1016\/s0012-365x(96)00062-3","type":"journal-article","created":{"date-parts":[[2003,4,23]],"date-time":"2003-04-23T20:16:34Z","timestamp":1051128994000},"page":"285-290","source":"Crossref","is-referenced-by-count":2,"title":["Totally equimatchable graphs"],"prefix":"10.1016","volume":"164","author":[{"given":"Jerzy","family":"Topp","sequence":"first","affiliation":[]},{"given":"Preben D.","family":"Vestergaard","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0012-365X(96)00062-3_BIB1","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1002\/jgt.3190010209","article-title":"Total matchings and total coverings of graphs","volume":"1","author":"Alavi","year":"1977","journal-title":"J. Graph Theory"},{"key":"10.1016\/S0012-365X(96)00062-3_BIB2","series-title":"Graphs and Digraphs","author":"Chartrand","year":"1986"},{"key":"10.1016\/S0012-365X(96)00062-3_BIB3","doi-asserted-by":"crossref","first-page":"439","DOI":"10.1002\/jgt.3190100403","article-title":"Equimatchable factor-critical graphs","volume":"10","author":"Favaron","year":"1986","journal-title":"J. Graph Theory"},{"key":"10.1016\/S0012-365X(96)00062-3_BIB4","series-title":"Graph Theory","author":"Harary","year":"1969"},{"key":"10.1016\/S0012-365X(96)00062-3_BIB5","series-title":"Matching Theory","author":"Lov\u00e1sz","year":"1986"},{"key":"10.1016\/S0012-365X(96)00062-3_BIB6","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1016\/S0021-9800(70)80011-4","article-title":"Some covering concepts in graphs","volume":"8","author":"Plummer","year":"1970","journal-title":"J. Combin. Theory"},{"key":"10.1016\/S0012-365X(96)00062-3_BIB7","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1080\/16073606.1993.9631737","article-title":"Well-covered graphs: a survey","volume":"16","author":"Plummer","year":"1993","journal-title":"Quaest. Math."},{"key":"10.1016\/S0012-365X(96)00062-3_BIB8","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1002\/jgt.3190030209","article-title":"Randomly matchable graphs","volume":"3","author":"Sumner","year":"1979","journal-title":"J. Graph Theory"}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X96000623?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X96000623?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,30]],"date-time":"2019-04-30T23:21:15Z","timestamp":1556666475000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0012365X96000623"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,2]]},"references-count":8,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1997,2]]}},"alternative-id":["S0012365X96000623"],"URL":"https:\/\/doi.org\/10.1016\/s0012-365x(96)00062-3","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[1997,2]]}}}