{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,10,1]],"date-time":"2022-10-01T20:25:51Z","timestamp":1664655951225},"reference-count":10,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2014,12,5]],"date-time":"2014-12-05T00:00:00Z","timestamp":1417737600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2015,9]]},"DOI":"10.1007\/s00373-014-1483-4","type":"journal-article","created":{"date-parts":[[2014,12,4]],"date-time":"2014-12-04T11:17:09Z","timestamp":1417691829000},"page":"1649-1658","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Polynomial Time Recognition of Essential Graphs Having Stability Number Equal to Matching Number"],"prefix":"10.1007","volume":"31","author":[{"given":"Raffaele","family":"Mosca","sequence":"first","affiliation":[]},{"given":"Paolo","family":"Nobili","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2014,12,5]]},"reference":[{"key":"1483_CR1","first-page":"46","volume":"22","author":"J-M Bourjolly","year":"1984","unstructured":"Bourjolly, J.-M., Hammer, P.L., Simeone, B.: Node-weighted graphs having the K\u00f6nig-Egerv\u00e1ry property. Math. Program. Study 22, 46\u201363 (1984)","journal-title":"Math. Program. Study"},{"key":"1483_CR2","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1016\/0020-0190(77)90068-0","volume":"6","author":"F Gavril","year":"1977","unstructured":"Gavril, F.: Testing for equality between maximum matching and minimum edge cover. Information Processing Letters 6, 199\u2013202 (1977)","journal-title":"Information Processing Letters"},{"key":"1483_CR3","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-97881-4","volume-title":"Geometric Algorithms and Combinatorial Optimization","author":"M Gr\u00f6tschel","year":"1988","unstructured":"Gr\u00f6tschel, M., Lov\u00e1sz, L., Schrijver, A.: Geometric Algorithms and Combinatorial Optimization. Springer, Berlin (1988)"},{"issue":"4","key":"1483_CR4","doi-asserted-by":"crossref","first-page":"511","DOI":"10.1137\/0603052","volume":"3","author":"PL Hammer","year":"1982","unstructured":"Hammer, P.L., Hansen, P., Simeone, B.: Vertices belonging to all or to no maximum stable sets of a graph. SIAM J. Alg. Disc. Math. 3(4), 511\u2013522 (1982)","journal-title":"SIAM J. Alg. Disc. Math."},{"key":"1483_CR5","doi-asserted-by":"crossref","DOI":"10.21236\/AD0705364","volume-title":"Graph Theory","author":"F Harary","year":"1969","unstructured":"Harary, F.: Graph Theory. Addison-Wesley, Reading (1969)"},{"key":"1483_CR6","unstructured":"Levit V.E., E. Mandrescu, A characterization of K\u00f6nig-Egerv\u00e1ry graphs using a common property of all maximum matchings, (2009) arXiv:0911.4626 [cs.DM]"},{"key":"1483_CR7","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1007\/s00373-011-1037-y","volume":"28","author":"VE 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":"1483_CR8","doi-asserted-by":"crossref","first-page":"367","DOI":"10.1007\/s003730200027","volume":"18","author":"R Mosca","year":"2002","unstructured":"Mosca, R.: A shy invariant of graphs. Graphs Combinat. 18, 367\u2013379 (2002)","journal-title":"Graphs Combinat."},{"key":"1483_CR9","doi-asserted-by":"crossref","unstructured":"Pulleyblank W.R., Polyhedral combinatorics. In: Nemhauser, G.L., Rinnoy Kan, A.H.G., Todd, M.J.: (eds.) Handbooks in Operation Research and Manegement Science, Vol 1, Optimization, North-Holland, 371\u2013446 (1989)","DOI":"10.1016\/S0927-0507(89)01006-6"},{"key":"1483_CR10","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-014-1483-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00373-014-1483-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-014-1483-4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,18]],"date-time":"2019-08-18T04:19:26Z","timestamp":1566101966000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00373-014-1483-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,12,5]]},"references-count":10,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2015,9]]}},"alternative-id":["1483"],"URL":"https:\/\/doi.org\/10.1007\/s00373-014-1483-4","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,12,5]]}}}