{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,28]],"date-time":"2025-09-28T12:44:30Z","timestamp":1759063470064},"reference-count":12,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2010,4,13]],"date-time":"2010-04-13T00:00:00Z","timestamp":1271116800000},"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":[[2010,9]]},"DOI":"10.1007\/s00373-010-0940-y","type":"journal-article","created":{"date-parts":[[2010,4,12]],"date-time":"2010-04-12T03:05:35Z","timestamp":1271041535000},"page":"721-726","source":"Crossref","is-referenced-by-count":5,"title":["K\u00f6nig\u2013Egerv\u00e1ry Graphs are Non-Edmonds"],"prefix":"10.1007","volume":"26","author":[{"given":"P.","family":"Mark Kayll","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2010,4,13]]},"reference":[{"key":"940_CR1","first-page":"147","volume":"5","author":"G. Birkhoff","year":"1946","unstructured":"Birkhoff G.: Tres observaciones sobre el algebra lineal. Univ. Nac. Tucum\u00e1n Revista A 5, 147\u2013151 (1946)","journal-title":"Univ. Nac. Tucum\u00e1n Revista A"},{"key":"940_CR2","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-84628-970-5","volume-title":"Graph Theory","author":"J.A. Bondy","year":"2008","unstructured":"Bondy J.A., Murty U.S.R.: Graph Theory. Springer, New York (2008)"},{"key":"940_CR3","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1016\/j.jctb.2004.08.003","volume":"92","author":"M.H. Carvalho de","year":"2004","unstructured":"de Carvalho M.H., Lucchesi C.L., Murty U.S.R.: The perfect matching polytope and solid bricks. J. Combin. Theory Ser. B 92, 319\u2013324 (2004)","journal-title":"J. Combin. Theory Ser. B"},{"key":"940_CR4","volume-title":"Linear Programming","author":"V. Chv\u00e1tal","year":"1983","unstructured":"Chv\u00e1tal V.: Linear Programming. W.H. Freeman and Co., New York (1983)"},{"key":"940_CR5","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\u2014an extension of the Koenig\u2013Egervary theorem. Discrete Math. 27, 23\u201333 (1979)","journal-title":"Discrete Math."},{"key":"940_CR6","doi-asserted-by":"crossref","first-page":"125","DOI":"10.6028\/jres.069B.013","volume":"69B","author":"J. Edmonds","year":"1965","unstructured":"Edmonds J.: Maximum matching and a polyhedron with 0,1-vertices. J. Res. Nat. Bur. Standards Sect. B 69B, 125\u2013130 (1965)","journal-title":"J. Res. Nat. Bur. Standards Sect. B"},{"key":"940_CR7","doi-asserted-by":"crossref","first-page":"449","DOI":"10.4153\/CJM-1965-045-4","volume":"17","author":"J. Edmonds","year":"1965","unstructured":"Edmonds J.: Paths, trees, and flowers. Canad. J. Math. 17, 449\u2013467 (1965)","journal-title":"Canad. J. Math."},{"key":"940_CR8","first-page":"16","volume":"38","author":"E. Egerv\u00e1ry","year":"1931","unstructured":"Egerv\u00e1ry E.: \u00dcber kombinatorische Eigenschaften von Matrizen. Mat. Fiz. Lapok 38, 16\u201328 (1931)","journal-title":"Mat. Fiz. Lapok"},{"key":"940_CR9","first-page":"116","volume":"38","author":"D. K\u00f6nig","year":"1931","unstructured":"K\u00f6nig D.: Graphen und Matrices. Mat. Fiz. Lapok 38, 116\u2013119 (1931)","journal-title":"Mat. Fiz. Lapok"},{"key":"940_CR10","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1002\/nav.3800020109","volume":"2","author":"H.W. Kuhn","year":"1955","unstructured":"Kuhn H.W.: The Hungarian method for the assignment problem. Naval Res. Logist. Quart. 2, 83\u201397 (1955)","journal-title":"Naval Res. Logist. Quart."},{"key":"940_CR11","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. Combin. Theory Ser. B 27, 228\u2013229 (1979)","journal-title":"J. Combin. Theory Ser. B"},{"key":"940_CR12","doi-asserted-by":"crossref","unstructured":"von Neumann, J.: A certain zero-sum two-person game equivalent to the optimal assignment problem. In: Kuhn, H.W., Tucker, A.W. (eds.) Contributions to the Theory of Games, vol. II, pp. 5\u201312. Ann. of Math. Stud. 28 Princeton University Press, Princeton (1953)","DOI":"10.1515\/9781400881970-002"}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-010-0940-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00373-010-0940-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-010-0940-y","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,28]],"date-time":"2019-05-28T10:58:31Z","timestamp":1559041111000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00373-010-0940-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,4,13]]},"references-count":12,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2010,9]]}},"alternative-id":["940"],"URL":"https:\/\/doi.org\/10.1007\/s00373-010-0940-y","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,4,13]]}}}