{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,13]],"date-time":"2026-02-13T08:46:19Z","timestamp":1770972379658,"version":"3.50.1"},"reference-count":22,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[1983,3,1]],"date-time":"1983-03-01T00:00:00Z","timestamp":415324800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Combinatorica"],"published-print":{"date-parts":[[1983,3]]},"DOI":"10.1007\/bf02579346","type":"journal-article","created":{"date-parts":[[2007,3,22]],"date-time":"2007-03-22T22:17:58Z","timestamp":1174601878000},"page":"105-117","source":"Crossref","is-referenced-by-count":50,"title":["Ear-decompositions of matching-covered graphs"],"prefix":"10.1007","volume":"3","author":[{"given":"L.","family":"Lov\u00e1sz","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"BF02579346_CR1","first-page":"9","volume-title":"Theory of Graphs","author":"B. Andr\u00e1sfai","year":"1967","unstructured":"B. Andr\u00e1sfai, On critical graphs, in:Theory of Graphs, Dunod, Paris\u2014Gordon and Breach, New York, (1967) 9\u201319."},{"key":"BF02579346_CR2","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1016\/0012-365X(78)90107-3","volume":"23","author":"C. Berge","year":"1978","unstructured":"C. Berge, Regularizable graphs I\u2013II,Discrete Math. 23 (1978) 85\u201389 and 91\u201395.","journal-title":"Discrete Math."},{"key":"BF02579346_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":"R. W. Deming, Independence numbers of graphs \u2014 an extension of the K\u00f6nig\u2014Egerv\u00e1ry theorem,Discrete Math. 27 (1979) 23\u201333.","journal-title":"Discrete Math."},{"key":"BF02579346_CR4","doi-asserted-by":"crossref","first-page":"449","DOI":"10.4153\/CJM-1965-045-4","volume":"17","author":"J. Edmonds","year":"1965","unstructured":"J. Edmonds, Paths, trees and flowers,Can. J. Math. 17 (1965) 449\u2013467.","journal-title":"Can. J. Math."},{"key":"BF02579346_CR5","first-page":"181","volume":"4","author":"P. Erd\u0151s","year":"1961","unstructured":"P. Erd\u0151s andT. Gallai, On the minimal number of vertices representing the edges of a graph,Publ. Math. Inst. Hung. Acad. Sci. 4 (1961) 181\u2013205.","journal-title":"Publ. Math. Inst. Hung. Acad. Sci."},{"key":"BF02579346_CR6","first-page":"401","volume":"9","author":"T. Gallai","year":"1965","unstructured":"T. Gallai, Maximale Systeme unabh\u00e4ngiger Kanten,Publ. Math. Inst. Hung. Acad. Sci. 9 (1965) 401\u2013413.","journal-title":"Publ. Math. Inst. Hung. Acad. Sci."},{"key":"BF02579346_CR7","doi-asserted-by":"crossref","first-page":"720","DOI":"10.4153\/CJM-1965-072-1","volume":"17","author":"A. Hajnal","year":"1965","unstructured":"A. Hajnal, Onk-saturated graphs,Can. J. Math. 17 (1965) 720\u2013724.","journal-title":"Can. J. Math."},{"key":"BF02579346_CR8","doi-asserted-by":"crossref","first-page":"388","DOI":"10.1090\/S0002-9939-1970-0252415-3","volume":"24","author":"D. J. Hartfield","year":"1970","unstructured":"D. J. Hartfield, A simplified form for nearly reducible and nearly decomposable matrices,Proc. Amer. Math. Soc. 24 (1970) 388\u2013393.","journal-title":"Proc. Amer. Math. Soc."},{"key":"BF02579346_CR9","unstructured":"G. Hetyei, 2\u00d71-es t\u00e9glalapokkal lefedhet\u0151 idomokr\u00f3l,P\u00e9csi Tan\u00e1rk\u00e9pz\u0151 F\u0151iskola Tud. K\u0151zl. (1964) 351\u2013368."},{"key":"BF02579346_CR10","first-page":"73","volume":"9","author":"A. Kotzig","year":"1959","unstructured":"A. Kotzig, Ein Beitrag zur Theorie der endlichen Graphen I\u2013II\u2013III,Mat. Fyz. Casopis 9 (1959) 73\u201391, 136\u2013159, and10 (1960) 205\u2013215.","journal-title":"Mat. Fyz. Casopis"},{"key":"BF02579346_CR11","first-page":"221","volume":"33","author":"D. K\u00f6nig","year":"1915","unstructured":"D. K\u00f6nig, Vonalrendszerek \u00e9s determin\u00e1nsok,Mat. Term. \u00c9rt. 33 (1915) 221\u2013229.","journal-title":"Mat. Term. \u00c9rt."},{"key":"BF02579346_CR12","doi-asserted-by":"crossref","first-page":"450","DOI":"10.1017\/S144678870002913X","volume":"18","author":"G. H. C. Little","year":"1974","unstructured":"G. H. C. Little, A theorem on connected praphs in which every edge belongs to a 1-factor,J. Austral. Math. Soc. 18 (1974) 450\u2013452.","journal-title":"J. Austral. Math. Soc."},{"key":"BF02579346_CR13","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1007\/BF01889914","volume":"23","author":"L. Lov\u00e1sz","year":"1972","unstructured":"L. Lov\u00e1sz, On the structure of factorizable graphs,Acta Math. Acad. Sci. Hung. 23 (1972) 179\u2013195.","journal-title":"Acta Math. Acad. Sci. Hung."},{"key":"BF02579346_CR14","unstructured":"L. Lov\u00e1sz, Some finite basis theorems an graph theory, in:Combinatorics (ed. A. Hajnal and V. T. S\u00f3s), Nort-Holland, 1978, 717\u2013729."},{"key":"BF02579346_CR15","unstructured":"L. Lov\u00e1sz andM. D. Plummer, On bicritical graphs, in:Infinite and Finite sets, (ed. A. Hajnal, R. Rado and V. T. S\u00f3s) North-Holland, 1975, 1051\u20131979."},{"key":"BF02579346_CR16","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1016\/0095-8956(77)90062-4","volume":"23","author":"L. Lov\u00e1sz","year":"1977","unstructured":"L. Lov\u00e1sz andM. D. Plummer, On minimal elementary bipartite graphs,J. Comb. Theory B 23 (1977) 127\u2013138.","journal-title":"J. Comb. Theory B"},{"key":"BF02579346_CR17","doi-asserted-by":"crossref","unstructured":"D. Naddef, Rank of maximum matchings in a graph,Math. Programming (1981).","DOI":"10.1007\/BF01581025"},{"key":"BF02579346_CR18","doi-asserted-by":"crossref","unstructured":"D. Naddef, andW. R. Pulleyblank, Ear decomposition of elementary graphs andGF 2-rank of perfect matchings,preprint (1981).","DOI":"10.1016\/S0304-0208(08)72455-1"},{"key":"BF02579346_CR19","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1016\/0012-365X(80)90037-0","volume":"31","author":"M. D. Plummer","year":"1980","unstructured":"M. D. Plummer, Onn-extendable graphs,Discrete Math. 31 (1980) 201\u2013210.","journal-title":"Discrete Math."},{"key":"BF02579346_CR20","unstructured":"F. Sterboul, A characterization of the graphs in which the transversal number equals the matching number,preprint."},{"key":"BF02579346_CR21","unstructured":"L. Sur\u00e1nyi, On line-critical graphs, in:Infinite and Finite Sets (ed. A. Hajnal, R. Rado and V. T. S\u00f3s), North-Holland (1975) 1411\u20131444."},{"key":"BF02579346_CR22","doi-asserted-by":"crossref","first-page":"922","DOI":"10.1090\/S0002-9939-1953-0063009-7","volume":"4","author":"W. T. Tutte","year":"1953","unstructured":"W. T. Tutte, The 1-factors of oriented graphs,Proc. Amer. Math. Soc. 4 (1953) 922\u2013931.","journal-title":"Proc. Amer. Math. Soc."}],"container-title":["Combinatorica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02579346.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF02579346\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02579346","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,11]],"date-time":"2023-05-11T04:25:19Z","timestamp":1683779119000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF02579346"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1983,3]]},"references-count":22,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1983,3]]}},"alternative-id":["BF02579346"],"URL":"https:\/\/doi.org\/10.1007\/bf02579346","relation":{},"ISSN":["0209-9683","1439-6912"],"issn-type":[{"value":"0209-9683","type":"print"},{"value":"1439-6912","type":"electronic"}],"subject":[],"published":{"date-parts":[[1983,3]]}}}