{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,1]],"date-time":"2022-04-01T21:48:55Z","timestamp":1648849735644},"reference-count":15,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2012,10,12]],"date-time":"2012-10-12T00:00:00Z","timestamp":1350000000000},"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":[[2013,11]]},"DOI":"10.1007\/s00373-012-1230-7","type":"journal-article","created":{"date-parts":[[2012,10,11]],"date-time":"2012-10-11T10:37:31Z","timestamp":1349951851000},"page":"1867-1879","source":"Crossref","is-referenced-by-count":1,"title":["On Unicyclic Graphs with Uniquely Restricted Maximum Matchings"],"prefix":"10.1007","volume":"29","author":[{"given":"Vadim E.","family":"Levit","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Eugen","family":"Mandrescu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2012,10,12]]},"reference":[{"key":"1230_CR1","first-page":"183","volume":"16","author":"G. Chaty","year":"1979","unstructured":"Chaty G., Chein M.: Ordered matchings and matchings without alternating cycles in bipartite graphs. Util. Math. 16, 183\u2013187 (1979)","journal-title":"Util. Math."},{"key":"1230_CR2","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1016\/j.disc.2004.08.027","volume":"293","author":"W. Goddard","year":"2005","unstructured":"Goddard W., Hedetniemi S.M., Hedetniemi S.T., Laskar R.: Generalized subgraph-restricted matchings in graphs. Discret. Math. 293, 129\u2013138 (2005)","journal-title":"Discret. Math."},{"key":"1230_CR3","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1007\/s00453-001-0004-z","volume":"31","author":"M.C. Golumbic","year":"2001","unstructured":"Golumbic M.C., Hirst T., Lewenstein M.: Uniquely restricted matchings. Algorithmica 31, 139\u2013154 (2001)","journal-title":"Algorithmica"},{"key":"1230_CR4","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1080\/03081089308818204","volume":"34","author":"D. Hershkowitz","year":"1993","unstructured":"Hershkowitz D., Schneider H.: Ranks of zero patterns and sign patterns. Linear Multilinear Algebra 34, 3\u201319 (1993)","journal-title":"Linear Multilinear Algebra"},{"key":"1230_CR5","doi-asserted-by":"crossref","first-page":"517","DOI":"10.1145\/322092.322100","volume":"25","author":"A. Itai","year":"1978","unstructured":"Itai A., Rodeh M., Tanimoto S.L.: Some matching problems for bipartite graphs. J. Assoc. Comput. Mach. 25, 517\u2013525 (1978)","journal-title":"J. Assoc. Comput. Mach."},{"key":"1230_CR6","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-58191-5","volume-title":"Greedoids","author":"B. Korte","year":"1991","unstructured":"Korte B., Lov\u00e1sz L., Schrader R.: Greedoids. Springer-Verlag, Berlin (1991)"},{"key":"1230_CR7","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1016\/0012-365X(77)90118-2","volume":"19","author":"S. Krogdahl","year":"1977","unstructured":"Krogdahl S.: The dependence graph for bases in matroids. Discret. Math. 19, 47\u201359 (1977)","journal-title":"Discret. Math."},{"key":"1230_CR8","doi-asserted-by":"crossref","unstructured":"Levit, V.E., Mandrescu, E.: Unicycle bipartite graphs with only uniquely restricted maximum matchings. In: Calude, C.S., Dinneen, M.J., Sburlan S. (eds.) Proceedings of the Third International Conference on Combinatorics, Computability and Logic, (DMTCS\u20191), Springer, pp. 151\u2013158 (2001)","DOI":"10.1007\/978-1-4471-0717-0_13"},{"key":"1230_CR9","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1016\/S0166-218X(01)00332-8","volume":"124","author":"V.E. Levit","year":"2002","unstructured":"Levit V.E., Mandrescu E.: A new greedoid: the family of local maximum stable sets of a forest. Discret. Appl. Math. 124, 91\u2013101 (2002)","journal-title":"Discret. Appl. Math."},{"key":"1230_CR10","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1016\/S0166-218X(03)00398-6","volume":"132","author":"V.E. Levit","year":"2003","unstructured":"Levit V.E., Mandrescu E.: Local maximum stable sets in bipartite graphs with uniquely restricted maximum matchings. Discret. Appl. Math. 132, 163\u2013174 (2003)","journal-title":"Discret. Appl. Math."},{"key":"1230_CR11","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1016\/j.endm.2005.06.055","volume":"22","author":"V.E. Levit","year":"2005","unstructured":"Levit V.E., Mandrescu E.: Unicycle graphs and uniquely restricted maximum matchings. Electron. Notes Discret. Math. 22, 261\u2013265 (2005)","journal-title":"Electron. Notes Discret. Math."},{"key":"1230_CR12","first-page":"183","volume":"197","author":"V.E. Levit","year":"2009","unstructured":"Levit V.E., Mandrescu E.: Greedoids on vertex sets of unicycle graphs. Congr. Numerantium 197, 183\u2013191 (2009)","journal-title":"Congr. Numerantium"},{"key":"1230_CR13","doi-asserted-by":"crossref","first-page":"377","DOI":"10.1023\/A:1006437630359","volume":"17","author":"V.V. Lozin","year":"2000","unstructured":"Lozin V.V., Gerber M.U.: On the jump number problem in hereditary classes of bipartite graphs. Order 17, 377\u2013385 (2000)","journal-title":"Order"},{"key":"1230_CR14","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1007\/BF00383169","volume":"7","author":"H. M\u00fcller","year":"1990","unstructured":"M\u00fcller H.: Alternating cycle-free matchings. Order 7, 11\u201321 (1990)","journal-title":"Order"},{"key":"1230_CR15","doi-asserted-by":"crossref","first-page":"232","DOI":"10.1007\/BF01580444","volume":"8","author":"G.L. Nemhauser","year":"1975","unstructured":"Nemhauser G.L., Trotter L.E. Jr: Vertex packings: structural properties and algorithms. Math. Program. 8, 232\u2013248 (1975)","journal-title":"Math. Program."}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-012-1230-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00373-012-1230-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-012-1230-7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,7,4]],"date-time":"2019-07-04T12:07:36Z","timestamp":1562242056000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00373-012-1230-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,10,12]]},"references-count":15,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2013,11]]}},"alternative-id":["1230"],"URL":"https:\/\/doi.org\/10.1007\/s00373-012-1230-7","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,10,12]]}}}