{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,16]],"date-time":"2024-09-16T11:10:34Z","timestamp":1726485034092},"reference-count":15,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Information Processing Letters"],"published-print":{"date-parts":[[2014,1]]},"DOI":"10.1016\/j.ipl.2013.08.002","type":"journal-article","created":{"date-parts":[[2013,8,21]],"date-time":"2013-08-21T14:01:47Z","timestamp":1377093707000},"page":"66-71","update-policy":"http:\/\/dx.doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":7,"title":["Efficient recognition of equimatchable graphs"],"prefix":"10.1016","volume":"114","author":[{"given":"Marc","family":"Demange","sequence":"first","affiliation":[]},{"given":"T\u0131naz","family":"Ekim","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"year":"1973","series-title":"Graphs and Hypergraphs","author":"Berge","key":"10.1016\/j.ipl.2013.08.002_br0010"},{"key":"10.1016\/j.ipl.2013.08.002_br0020","doi-asserted-by":"crossref","first-page":"449","DOI":"10.4153\/CJM-1965-045-4","article-title":"Paths, trees and flowers","volume":"17","author":"Edmonds","year":"1965","journal-title":"Can. J. Math."},{"key":"10.1016\/j.ipl.2013.08.002_br0030","doi-asserted-by":"crossref","first-page":"439","DOI":"10.1002\/jgt.3190100403","article-title":"Equimatchable factor-critical graphs","volume":"4","author":"Favaron","year":"1986","journal-title":"J. Graph Theory"},{"key":"10.1016\/j.ipl.2013.08.002_br0040","first-page":"185","article-title":"A note on equimatchable graphs","volume":"46","author":"Frendrup","year":"2010","journal-title":"Australas. J. Comb."},{"key":"10.1016\/j.ipl.2013.08.002_br0050","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1007\/BF02239502","article-title":"An O(|V|.|E|) algorithm for maximum matching in general graphs","volume":"12","author":"Kameda","year":"1974","journal-title":"Computing"},{"key":"10.1016\/j.ipl.2013.08.002_br0060","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1007\/s00373-008-0838-0","article-title":"Bounding the size of equimatchable graphs of fixed genus","volume":"1","author":"Kawarabayashi","year":"2009","journal-title":"Graphs Comb."},{"issue":"3","key":"10.1016\/j.ipl.2013.08.002_br0070","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1016\/S0012-365X(02)00813-0","article-title":"On two equimatchable graph classes","volume":"1","author":"Kawarabayashi","year":"2003","journal-title":"Discrete Math."},{"article-title":"Equi-matchable graphs","year":"1984","series-title":"Graph Theory and Combinatorics","author":"Lesk","key":"10.1016\/j.ipl.2013.08.002_br0080"},{"key":"10.1016\/j.ipl.2013.08.002_br0090","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1007\/BF02760842","article-title":"Matching-perfect and cover-perfect graphs","volume":"18","author":"Lewin","year":"1974","journal-title":"Isr. J. Math."},{"volume":"vol. 29","article-title":"Matching Theory","year":"1986","author":"Lov\u00e1sz","key":"10.1016\/j.ipl.2013.08.002_br0100"},{"year":"1974","series-title":"Matchings and coverings for graphs","author":"Meng","key":"10.1016\/j.ipl.2013.08.002_br0110"},{"key":"10.1016\/j.ipl.2013.08.002_br0120","series-title":"Proceedings of 21st Annual Symposium on Foundations of Computer Science, FOCS 1980, IEEE","first-page":"17","article-title":"An O(|V||E|) algorithm for finding maximum matching in general graphs","author":"Micali","year":"1980"},{"key":"10.1016\/j.ipl.2013.08.002_br0130","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"},{"key":"10.1016\/j.ipl.2013.08.002_br0140","doi-asserted-by":"crossref","first-page":"230","DOI":"10.1006\/jctb.1996.1742","article-title":"The structure of well-covered graphs and the complexity of their recognition problems","volume":"67","author":"Tankus","year":"1997","journal-title":"J. Comb. Theory, Ser. B"},{"key":"10.1016\/j.ipl.2013.08.002_br0150","series-title":"Proceedings of the 22nd Annual ACM\u2013SIAM Symposium on Discrete Algorithms, San Francisco, CA","first-page":"630","article-title":"An algorithmic decomposition of claw-free graphs leading to an O(n3)-algorithm for the weighted stable set problem","author":"Stauffer","year":"2011"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019013002184?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019013002184?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2018,10,13]],"date-time":"2018-10-13T16:50:53Z","timestamp":1539449453000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0020019013002184"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,1]]},"references-count":15,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2014,1]]}},"alternative-id":["S0020019013002184"],"URL":"https:\/\/doi.org\/10.1016\/j.ipl.2013.08.002","relation":{},"ISSN":["0020-0190"],"issn-type":[{"type":"print","value":"0020-0190"}],"subject":[],"published":{"date-parts":[[2014,1]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Efficient recognition of equimatchable graphs","name":"articletitle","label":"Article Title"},{"value":"Information Processing Letters","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.ipl.2013.08.002","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 2013 Elsevier B.V. All rights reserved.","name":"copyright","label":"Copyright"}]}}