{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,2]],"date-time":"2022-04-02T06:51:14Z","timestamp":1648882274507},"reference-count":10,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[1985,12,1]],"date-time":"1985-12-01T00:00:00Z","timestamp":502243200000},"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":[[1985,12]]},"DOI":"10.1007\/bf02579252","type":"journal-article","created":{"date-parts":[[2007,3,22]],"date-time":"2007-03-22T21:15:24Z","timestamp":1174598124000},"page":"359-365","source":"Crossref","is-referenced-by-count":2,"title":["Maximal tight sets and the edmonds\u2014Gallai decomposition for matchings"],"prefix":"10.1007","volume":"5","author":[{"given":"K.","family":"Steffens","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"BF02579252_CR1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF02579151","volume":"4","author":"R. Aharoni","year":"1984","unstructured":"R. Aharoni, On an obstruction for perfect matchings,Combinatorica,4 (1984), 1\u20136.","journal-title":"Combinatorica"},{"key":"BF02579252_CR2","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1016\/0095-8956(84)90052-2","volume":"37","author":"R. Aharoni","year":"1984","unstructured":"R. Aharoni, A generalization of Tutte\u2019s 1-factor theorem to countable graphs,J. Comb. Th. (B) 37 (1984), 199\u2013209.","journal-title":"J. Comb. Th. (B)"},{"key":"BF02579252_CR3","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1007\/BF02579231","volume":"2","author":"F. Bry","year":"1982","unstructured":"F. Bry andM. Las Vergnas, The Edmonds\u2014Gallai decomposition for matchings in locally finite graphs,Combinatorica,2 (1982), 229\u2013235.","journal-title":"Combinatorica"},{"key":"BF02579252_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":"BF02579252_CR5","first-page":"373","volume":"9","author":"T. Gallai","year":"1964","unstructured":"T. Gallai, Maximale Systeme unabh\u00e4ngiger Kanten,Mat. Kut. Int. K\u00f6zl.,9 (1964), 373\u2013395.","journal-title":"Mat. Kut. Int. K\u00f6zl."},{"key":"BF02579252_CR6","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1007\/BF02022560","volume":"1","author":"T. Gallai","year":"1950","unstructured":"T. Gallai, On factorization of graphs,Acta Math. Acad. Sci. Hungar.,1 (1950), 133\u2013153.","journal-title":"Acta Math. Acad. Sci. Hungar."},{"key":"BF02579252_CR7","doi-asserted-by":"crossref","unstructured":"F. Harary,Graph Theory, Addison\u2014Wesley 1969.","DOI":"10.21236\/AD0705364"},{"key":"BF02579252_CR8","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\u2013185.","journal-title":"Acta Math. Acad. Sci, Hung."},{"key":"BF02579252_CR9","volume-title":"Ein Reduktionsverfahren f\u00fcr Weg-endliche Graphen","author":"R. Schmidt","year":"1982","unstructured":"R. Schmidt,Ein Reduktionsverfahren f\u00fcr Weg-endliche Graphen, Dissertation, Hamburg 1982."},{"key":"BF02579252_CR10","doi-asserted-by":"crossref","first-page":"165","DOI":"10.4153\/CJM-1977-016-8","volume":"29","author":"K. Steffens","year":"1976","unstructured":"K. Steffens, Matchings in countable graphs,Can. J. Math.,29 (1976), 165\u2013168.","journal-title":"Can. J. Math."}],"container-title":["Combinatorica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02579252.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF02579252\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02579252","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,18]],"date-time":"2019-05-18T16:45:00Z","timestamp":1558197900000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF02579252"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1985,12]]},"references-count":10,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1985,12]]}},"alternative-id":["BF02579252"],"URL":"https:\/\/doi.org\/10.1007\/bf02579252","relation":{},"ISSN":["0209-9683","1439-6912"],"issn-type":[{"value":"0209-9683","type":"print"},{"value":"1439-6912","type":"electronic"}],"subject":[],"published":{"date-parts":[[1985,12]]}}}