{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,1,8]],"date-time":"2023-01-08T01:49:29Z","timestamp":1673142569551},"reference-count":27,"publisher":"Elsevier BV","issue":"16-17","license":[{"start":{"date-parts":[[2013,11,1]],"date-time":"2013-11-01T00:00:00Z","timestamp":1383264000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2017,11,1]],"date-time":"2017-11-01T00:00:00Z","timestamp":1509494400000},"content-version":"vor","delay-in-days":1461,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"funder":[{"DOI":"10.13039\/501100010253","name":"UBACyT","doi-asserted-by":"crossref","award":["20020100100980"],"id":[{"id":"10.13039\/501100010253","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100003074","name":"ANPCyT","doi-asserted-by":"crossref","award":["PICT-2012-1324"],"id":[{"id":"10.13039\/501100003074","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100002923","name":"CONICET","doi-asserted-by":"crossref","award":["PIP 112-200901-00178"],"id":[{"id":"10.13039\/501100002923","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100003593","name":"CNPq","doi-asserted-by":"crossref","id":[{"id":"10.13039\/501100003593","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100004586","name":"FAPERJ","doi-asserted-by":"crossref","id":[{"id":"10.13039\/501100004586","id-type":"DOI","asserted-by":"crossref"}]},{"name":"FONDECyT","award":["1110797"]},{"name":"Millennium Science Institute \u201cComplex Engineering Systems\u201d (Chile)"},{"DOI":"10.13039\/501100010253","name":"UBACyT","doi-asserted-by":"crossref","award":["20020100100980"],"id":[{"id":"10.13039\/501100010253","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100003074","name":"ANPCyT","doi-asserted-by":"crossref","award":["PICT-2012-1324"],"id":[{"id":"10.13039\/501100003074","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100002923","name":"CONICET","doi-asserted-by":"crossref","award":["PIP 112-200901-00178"],"id":[{"id":"10.13039\/501100002923","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[2013,11]]},"DOI":"10.1016\/j.dam.2013.04.020","type":"journal-article","created":{"date-parts":[[2013,5,29]],"date-time":"2013-05-29T10:00:32Z","timestamp":1369821632000},"page":"2380-2388","update-policy":"http:\/\/dx.doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":6,"title":["Forbidden subgraphs and the K\u00f6nig\u2013Egerv\u00e1ry property"],"prefix":"10.1016","volume":"161","author":[{"given":"Flavia","family":"Bonomo","sequence":"first","affiliation":[]},{"given":"Mitre C.","family":"Dourado","sequence":"additional","affiliation":[]},{"given":"Guillermo","family":"Dur\u00e1n","sequence":"additional","affiliation":[]},{"given":"Luerbio","family":"Faria","sequence":"additional","affiliation":[]},{"given":"Luciano N.","family":"Grippo","sequence":"additional","affiliation":[]},{"given":"Mart\u00edn D.","family":"Safe","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.dam.2013.04.020_br000005","first-page":"114","article-title":"F\u00e4rbung von Graphen, deren s\u00e4mtliche beziehungsweise, deren ungerade Kreise starr sind (Zusammenfassung)","volume":"10","author":"Berge","year":"1961","journal-title":"Wissenschaftliche Zeitschrift der Martin-Luther-Universit\u00e4t Halle-Wittenberg, Mathematisch-Naturwissenschaftliche Reihe"},{"key":"10.1016\/j.dam.2013.04.020_br000010","doi-asserted-by":"crossref","first-page":"842","DOI":"10.1073\/pnas.43.9.842","article-title":"Two theorems in graph theory","volume":"43","author":"Berge","year":"1957","journal-title":"Proceedings of the National Academy of Sciences"},{"key":"10.1016\/j.dam.2013.04.020_br000015","series-title":"Matroid Applications","first-page":"284","article-title":"Introduction to greedoids","volume":"vol. 40","author":"Bj\u00f6rner","year":"1992"},{"key":"10.1016\/j.dam.2013.04.020_br000020","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1016\/0166-218X(92)90273-D","article-title":"K\u00f6nig\u2013Egerv\u00e1ry graphs, 2-bicritical graphs and fractional matchings","volume":"24","author":"Bourjolly","year":"1989","journal-title":"Discrete Applied Mathematics"},{"key":"10.1016\/j.dam.2013.04.020_br000025","doi-asserted-by":"crossref","first-page":"51","DOI":"10.4007\/annals.2006.164.51","article-title":"The strong perfect graph theorem","volume":"164","author":"Chudnovsky","year":"2006","journal-title":"Annals of Mathematics"},{"key":"10.1016\/j.dam.2013.04.020_br000030","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1016\/0012-365X(79)90066-9","article-title":"Independence numbers of graphs\u2014an extension of the Koenig\u2013Egervary theorem","volume":"27","author":"Deming","year":"1979","journal-title":"Discrete Mathematics"},{"key":"10.1016\/j.dam.2013.04.020_br000035","unstructured":"M.P. Dobson, V.A. Leoni, G.L. Nasini, Recognizing edge-perfect graphs: some polynomial instances, in: Proceedings of the 8th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, Paris, France, 2009, pp. 153\u2013156."},{"key":"10.1016\/j.dam.2013.04.020_br000040","doi-asserted-by":"crossref","first-page":"54","DOI":"10.1016\/j.disopt.2012.10.004","article-title":"A characterization of edge-perfect graphs and the complexity of recognizing some combinatorial optimization games","volume":"10","author":"Dobson","year":"2013","journal-title":"Discrete Optimization"},{"key":"10.1016\/j.dam.2013.04.020_br000045","first-page":"16","article-title":"Matrixok kombinatorikus tulajdons\u00e1gair\u00f3l","volume":"38","author":"Egerv\u00e1ry","year":"1931","journal-title":"Matematikai \u00e9s Fizikai Lapok"},{"key":"10.1016\/j.dam.2013.04.020_br000050","first-page":"85","article-title":"A graph theoretical model for the total balancedness of combinatorial optimization games","volume":"53","author":"Escalante","year":"2012","journal-title":"Revista de la Uni\u00f3n Matem\u00e1tica Argentina"},{"key":"10.1016\/j.dam.2013.04.020_br000055","first-page":"133","article-title":"\u00dcber extreme Punkt- und Kantenmengen","volume":"2","author":"Gallai","year":"1959","journal-title":"Annales Universitatis Scientarium Budapestinensis de Rolando E\u00f6tv\u00f6s Nominatae Sectio Mathematica"},{"key":"10.1016\/j.dam.2013.04.020_br000060","first-page":"116","article-title":"Graphok \u00e9s matrixok","volume":"38","author":"K\u0151nig","year":"1931","journal-title":"Matematikai \u00e9s Fizikai Lapok"},{"key":"10.1016\/j.dam.2013.04.020_br000065","unstructured":"E. Korach, Flowers and trees in a ballet of K4, or a finite basis characterization of non-K\u0151nig\u2013Egerv\u00e1ry graphs, Technical Report 115, IBM-Israel Scientific Center, 1982."},{"key":"10.1016\/j.dam.2013.04.020_br000070","doi-asserted-by":"crossref","unstructured":"E. Korach, T. Nguyen, B. Peis, Subgraph characterization of red\/blue-split graph and K\u0151nig\u2013Egerv\u00e1ry graphs, in: Proceedings of the 17th Annual ACM\u2013SIAM Symposium on Discrete Algorithms, Miami, Florida, USA, 2006, pp. 842\u2013850.","DOI":"10.1145\/1109557.1109650"},{"key":"10.1016\/j.dam.2013.04.020_br000075","series-title":"Fundamentals of Computation Theory","first-page":"205","article-title":"Mathematical structures underlying greedy algorithms","volume":"vol. 117","author":"Korte","year":"1981"},{"key":"10.1016\/j.dam.2013.04.020_br000080","series-title":"Greedoids","volume":"vol. 4","author":"Korte","year":"1991"},{"key":"10.1016\/j.dam.2013.04.020_br000085","doi-asserted-by":"crossref","first-page":"294","DOI":"10.1016\/j.ejc.2010.10.004","article-title":"The critical independence number and an independence decomposition","volume":"32","author":"Larson","year":"2011","journal-title":"European Journal of Combinatorics"},{"key":"10.1016\/j.dam.2013.04.020_br000090","first-page":"209","article-title":"Well-covered and K\u00f6nig\u2013Egerv\u00e1ry graphs","volume":"130","author":"Levit","year":"1998","journal-title":"Congressus Numerantium"},{"key":"10.1016\/j.dam.2013.04.020_br000095","doi-asserted-by":"crossref","first-page":"1635","DOI":"10.1016\/j.dam.2013.01.005","article-title":"On maximum matchings in K\u00f6nig\u2013Egerv\u00e1ry graphs","volume":"161","author":"Levit","year":"2013","journal-title":"Discrete Applied Mathematics"},{"key":"10.1016\/j.dam.2013.04.020_br000100","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1007\/s00373-011-1037-y","article-title":"Critical independent sets and K\u00f6nig\u2013Egerv\u00e1ry graphs","volume":"28","author":"Levit","year":"2012","journal-title":"Graphs and Combinatorics"},{"key":"10.1016\/j.dam.2013.04.020_br000105","doi-asserted-by":"crossref","first-page":"2414","DOI":"10.1016\/j.dam.2007.05.039","article-title":"Triangle-free graphs with uniquely restricted maximum matchings and their corresponding greedoids","volume":"155","author":"Levit","year":"2007","journal-title":"Discrete Applied Mathematics"},{"key":"10.1016\/j.dam.2013.04.020_br000110","doi-asserted-by":"crossref","first-page":"588","DOI":"10.1016\/j.disc.2011.04.015","article-title":"On local maximum stable set greedoids","volume":"312","author":"Levit","year":"2012","journal-title":"Discrete Mathematics"},{"key":"10.1016\/j.dam.2013.04.020_br000115","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1007\/BF02579346","article-title":"Ear-decompositions of matching-covered graphs","volume":"3","author":"Lov\u00e1sz","year":"1983","journal-title":"Combinatorica"},{"key":"10.1016\/j.dam.2013.04.020_br000120","series-title":"Matching Theory","author":"Lov\u00e1sz","year":"1986"},{"key":"10.1016\/j.dam.2013.04.020_br000125","doi-asserted-by":"crossref","first-page":"721","DOI":"10.1007\/s00373-010-0940-y","article-title":"K\u00f6nig\u2013Egerv\u00e1ry graphs are non-Edmonds","volume":"26","author":"Mark Kayll","year":"2010","journal-title":"Graphs and Combinatorics"},{"key":"10.1016\/j.dam.2013.04.020_br000130","unstructured":"B. Peis, Structure analysis of some generalizations of matchings and matroids under algorithmic aspects, Ph.D. Thesis, Zentrum f\u00fcr Angewandte Informatik, Universit\u00e4t zu K\u00f6ln, Germany, 2006."},{"key":"10.1016\/j.dam.2013.04.020_br000135","doi-asserted-by":"crossref","first-page":"228","DOI":"10.1016\/0095-8956(79)90085-6","article-title":"A characterization of the graphs in which the transversal number equals the matching number","volume":"27","author":"Sterboul","year":"1979","journal-title":"Journal of Combinatorial Theory, Series B"}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X13002072?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X13002072?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,5,8]],"date-time":"2020-05-08T16:24:14Z","timestamp":1588955054000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X13002072"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,11]]},"references-count":27,"journal-issue":{"issue":"16-17","published-print":{"date-parts":[[2013,11]]}},"alternative-id":["S0166218X13002072"],"URL":"https:\/\/doi.org\/10.1016\/j.dam.2013.04.020","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[2013,11]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Forbidden subgraphs and the K\u00f6nig\u2013Egerv\u00e1ry property","name":"articletitle","label":"Article Title"},{"value":"Discrete Applied Mathematics","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.dam.2013.04.020","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"}]}}