{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,5]],"date-time":"2022-04-05T18:48:56Z","timestamp":1649184536480},"reference-count":9,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[1983,12,1]],"date-time":"1983-12-01T00:00:00Z","timestamp":439084800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Zeitschrift f\u00fcr Operations Research"],"published-print":{"date-parts":[[1983,12]]},"DOI":"10.1007\/bf01916906","type":"journal-article","created":{"date-parts":[[2005,7,23]],"date-time":"2005-07-23T12:05:00Z","timestamp":1122120300000},"page":"123-136","source":"Crossref","is-referenced-by-count":1,"title":["On a classification of independence systems"],"prefix":"10.1007","volume":"27","author":[{"given":"R.","family":"Euler","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"BF01916906_CR1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF01581022","volume":"22","author":"R. Giles","year":"1982","unstructured":"Giles, R.: Optimum Matching Forests I. Math. Programming22, 1982, 1\u201311.","journal-title":"Math. Programming"},{"key":"BF01916906_CR2","unstructured":"Jenkyns, T.A.: Matchoids: A Generalization of Matchings and Matroids. Thesis, University of Waterloo, 1974."},{"key":"BF01916906_CR3","unstructured":"Lawler, E.L.: Combinatorial Optimization: Networks and Matroids. New York 1976."},{"key":"BF01916906_CR4","unstructured":"Lov\u00e1sz, L.: The Matroid Parity Problem. University of Waterloo, 1979."},{"key":"BF01916906_CR5","doi-asserted-by":"crossref","first-page":"284","DOI":"10.1016\/0095-8956(80)90074-X","volume":"28","author":"G.J. Minty","year":"1980","unstructured":"Minty, G.J.: On Maximal independent Sets of Vertices in Claw-Free Graphs. Journal of Comb. Theory (B)28, 1980, 284\u2013304.","journal-title":"Journal of Comb. Theory (B)"},{"key":"BF01916906_CR6","unstructured":"Mirsky, L.: Transversal Theory. New York 1971."},{"key":"BF01916906_CR7","unstructured":"Sakarovitch, M.: Deux ou Trois Choses que Je Sais des Bitroides. Rapport de Recherche No. 55, IMAG, Universit\u00e9 de Grenoble, November 1976."},{"key":"BF01916906_CR8","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1016\/0012-365X(90)90287-R","volume":"29","author":"N. Sbihi","year":"1980","unstructured":"Sbihi, N.: Algorithme de Recherche d'un Stable de Cardinalit\u00e9 Maximum dans un Graphe sans Etoile. Discrete Mathematics29, 1980, 53\u201376.","journal-title":"Discrete Mathematics"},{"key":"BF01916906_CR9","unstructured":"Welsh, D.: Matroid Theory. New York 1976."}],"container-title":["Zeitschrift f\u00fcr Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01916906.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01916906\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01916906","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,10]],"date-time":"2019-05-10T16:46:55Z","timestamp":1557506815000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01916906"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1983,12]]},"references-count":9,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1983,12]]}},"alternative-id":["BF01916906"],"URL":"https:\/\/doi.org\/10.1007\/bf01916906","relation":{},"ISSN":["0340-9422","1432-5217"],"issn-type":[{"value":"0340-9422","type":"print"},{"value":"1432-5217","type":"electronic"}],"subject":[],"published":{"date-parts":[[1983,12]]}}}