{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,6,4]],"date-time":"2022-06-04T18:07:57Z","timestamp":1654366077292},"reference-count":18,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2012,6,8]],"date-time":"2012-06-08T00:00:00Z","timestamp":1339113600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2013,9]]},"DOI":"10.1007\/s00373-012-1196-5","type":"journal-article","created":{"date-parts":[[2012,6,7]],"date-time":"2012-06-07T05:21:57Z","timestamp":1339046517000},"page":"1453-1458","source":"Crossref","is-referenced-by-count":1,"title":["When is G 2 a K\u00f6nig\u2013Egerv\u00e1ry Graph?"],"prefix":"10.1007","volume":"29","author":[{"given":"Vadim E.","family":"Levit","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Eugen","family":"Mandrescu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2012,6,8]]},"reference":[{"key":"1196_CR1","doi-asserted-by":"crossref","first-page":"44","DOI":"10.1007\/BFb0121007","volume":"22","author":"J.M. Bourjolly","year":"1984","unstructured":"Bourjolly J.M., Hammer P.L., Simeone B.: Node weighted graphs having K\u00f6nig-Egervary property. Math. Program. Study 22, 44\u201363 (1984)","journal-title":"Math. Program. Study"},{"key":"1196_CR2","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1016\/0166-218X(92)90273-D","volume":"24","author":"J.M. Bourjolly","year":"1989","unstructured":"Bourjolly J.M., Pulleyblank W.R.: K\u00f6nig-Egerv\u00e1ry graphs, 2-bicritical graphs and fractional matchings. Discret. Appl. Math. 24, 63\u201382 (1989)","journal-title":"Discret. Appl. Math."},{"key":"1196_CR3","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1016\/0012-365X(79)90066-9","volume":"27","author":"R.W. Deming","year":"1979","unstructured":"Deming R.W.: Independence numbers of graphs - an extension of the K\u00f6nig-Egerv\u00e1ry theorem. Discret. Math. 27, 23\u201333 (1979)","journal-title":"Discret. Math."},{"key":"1196_CR4","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1016\/0012-365X(82)90215-1","volume":"42","author":"O. Favaron","year":"1982","unstructured":"Favaron O.: Very well-covered graphs. Discret. Math. 42, 177\u2013187 (1982)","journal-title":"Discret. Math."},{"key":"1196_CR5","doi-asserted-by":"crossref","unstructured":"Korach, E., Nguyen, T., Peis, B.: Subgraph Characterization of Red\/Blue-Split Graphs and K\u00f6nig-Egerv\u00e1ry Graphs. In: Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, ACM Press. pp. 842\u2013850 (2006)","DOI":"10.1145\/1109557.1109650"},{"key":"1196_CR6","doi-asserted-by":"crossref","first-page":"294","DOI":"10.1016\/j.ejc.2010.10.004","volume":"32","author":"C.E. Larson","year":"2011","unstructured":"Larson C.E.: The critical independence number and an independence decomposition. Eur. J. Combin. 32, 294\u2013300 (2011)","journal-title":"Eur. J. Combin."},{"key":"1196_CR7","first-page":"209","volume":"130","author":"V.E. Levit","year":"1998","unstructured":"Levit V.E., Mandrescu E.: Well-covered and K\u00f6nig-Egerv\u00e1ry graphs. Congr. Numer. 130, 209\u2013218 (1998)","journal-title":"Congr. Numer."},{"key":"1196_CR8","first-page":"102","volume":"139","author":"V.E. Levit","year":"1999","unstructured":"Levit V.E., Mandrescu E.: Well-covered trees. Congr. Numer. 139, 102\u2013112 (1999)","journal-title":"Congr. Numer."},{"key":"1196_CR9","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1016\/S0012-365X(02)00528-9","volume":"263","author":"V.E. Levit","year":"2003","unstructured":"Levit V.E., Mandrescu E.: On \u03b1 + -stable K\u00f6nig-Egerv\u00e1ry graphs. Discrete Math. 263, 179\u2013190 (2003)","journal-title":"Discrete Math."},{"key":"1196_CR10","first-page":"297","volume":"10","author":"V.E. Levit","year":"2005","unstructured":"Levit V.E., Mandrescu E.: Square-stable and well-covered graphs. Acta Univ. Apulensis 10, 297\u2013308 (2005)","journal-title":"Acta Univ. Apulensis"},{"key":"1196_CR11","unstructured":"Levit, V.E., Mandrescu, E.: On K\u00f6nig-Egerv\u00e1ry graphs and square-stable graphs, Acta Univ. Apulensis, Special Issue 425\u2013435 (2009)"},{"key":"1196_CR12","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1007\/s00373-011-1037-y","volume":"28","author":"V.E. Levit","year":"2012","unstructured":"Levit V.E., Mandrescu E.: Critical independent sets and K\u00f6nig-Egerv\u00e1ry graphs. Graphs Combinat. 28, 243\u2013250 (2012)","journal-title":"Graphs Combinat."},{"key":"1196_CR13","unstructured":"Lov\u00e1sz, L., Plummer, M.D.: Matching theory. Ann Discrete Math. 29, (1986)"},{"key":"1196_CR14","doi-asserted-by":"crossref","first-page":"580","DOI":"10.1016\/S0377-2217(96)00271-8","volume":"97","author":"V.T. Paschos","year":"1997","unstructured":"Paschos V.T., Demange M.: A generalization of K\u00f6nig-Egerv\u00e1ry graphs and heuristics for the maximum independent set problem with improved approximation ratios. Eur. J. Oper. Res. 97, 580\u2013592 (1997)","journal-title":"Eur. J. Oper. Res."},{"key":"1196_CR15","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1016\/S0021-9800(70)80011-4","volume":"8","author":"M.D. Plummer","year":"1970","unstructured":"Plummer M.D.: Some covering concepts in graphs. J. Combinat. Theory 8, 91\u201398 (1970)","journal-title":"J. Combinat. Theory"},{"key":"1196_CR16","first-page":"211","volume":"46","author":"B. Randerath","year":"1997","unstructured":"Randerath B., Volkman L.: Simplicial graphs and relationships to different graph invariants. Ars Combinat. 46, 211\u2013217 (1997)","journal-title":"Ars Combinat."},{"key":"1196_CR17","first-page":"20","volume":"2","author":"G. Ravindra","year":"1977","unstructured":"Ravindra G.: Well-covered graphs. J. Combin. Inform. Syst. Sci. 2, 20\u201321 (1977)","journal-title":"J. Combin. Inform. Syst. Sci."},{"key":"1196_CR18","doi-asserted-by":"crossref","first-page":"228","DOI":"10.1016\/0095-8956(79)90085-6","volume":"27","author":"F. Sterboul","year":"1979","unstructured":"Sterboul F.: A characterization of the graphs in which the transversal number equals the matching number. J. Combinat. Theory B 27, 228\u2013229 (1979)","journal-title":"J. Combinat. Theory B"}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-012-1196-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00373-012-1196-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-012-1196-5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,29]],"date-time":"2019-06-29T13:51:01Z","timestamp":1561816261000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00373-012-1196-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,6,8]]},"references-count":18,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2013,9]]}},"alternative-id":["1196"],"URL":"https:\/\/doi.org\/10.1007\/s00373-012-1196-5","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,6,8]]}}}