{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T17:39:00Z","timestamp":1725471540842},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540483816"},{"type":"electronic","value":"9783540483823"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11917496_28","type":"book-chapter","created":{"date-parts":[[2006,10,18]],"date-time":"2006-10-18T02:16:13Z","timestamp":1161137773000},"page":"313-324","source":"Crossref","is-referenced-by-count":2,"title":["Flexible Matchings"],"prefix":"10.1007","author":[{"given":"Mikl\u00f3s","family":"Bartha","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mikl\u00f3s","family":"Kr\u00e9sz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"28_CR1","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1016\/0020-0190(91)90196-O","volume":"40","author":"M. Bartha","year":"1991","unstructured":"Bartha, M., Gomb\u00e1s, E.: A structure theorem for maximum internal matchings in graphs. Information Processing Letters\u00a040, 289\u2013294 (1991)","journal-title":"Information Processing Letters"},{"key":"28_CR2","first-page":"49","volume":"13","author":"M. Bartha","year":"2002","unstructured":"Bartha, M., Kr\u00e9sz, M.: Isolating the families of soliton graphs. Pure Mathematics and Applications\u00a013, 49\u201362 (2002)","journal-title":"Pure Mathematics and Applications"},{"key":"28_CR3","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1016\/S0304-3975(02)00048-8","volume":"299","author":"M. Bartha","year":"2003","unstructured":"Bartha, M., Kr\u00e9sz, M.: Structuring the elementary components of graphs having a perfect internal matching. Theoretical Computer Science\u00a0299, 179\u2013210 (2003)","journal-title":"Theoretical Computer Science"},{"key":"28_CR4","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1016\/j.ipl.2004.05.016","volume":"91","author":"M. Bartha","year":"2004","unstructured":"Bartha, M., Kr\u00e9sz, M.: Tutte type theorems in graphs having a perfect internal matching. Information Processing Letters\u00a091, 277\u2013284 (2004)","journal-title":"Information Processing Letters"},{"key":"28_CR5","unstructured":"Bartha, M., Kr\u00e9sz, M.: Deterministic soliton graphs. Informatica (to appear)"},{"key":"28_CR6","doi-asserted-by":"publisher","first-page":"154","DOI":"10.1016\/0022-0000(90)90010-I","volume":"40","author":"J. Dassow","year":"1990","unstructured":"Dassow, J., J\u00fcrgensen, H.: Soliton automata. J. Comput. System Sci.\u00a040, 154\u2013181 (1990)","journal-title":"J. Comput. System Sci."},{"key":"28_CR7","doi-asserted-by":"publisher","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.\u00a017, 449\u2013467 (1965)","journal-title":"Canad. J. Math."},{"key":"28_CR8","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1016\/0022-0000(85)90014-5","volume":"30","author":"H.N. Gabow","year":"1985","unstructured":"Gabow, H.N., Tarjan, R.E.: A linear-time algorithm for a special case of disjoint set union. Journal of Computer and System Sciences\u00a030, 209\u2013221 (1985)","journal-title":"Journal of Computer and System Sciences"},{"key":"28_CR9","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1006\/jagm.2001.1167","volume":"40","author":"H.N. Gabow","year":"2001","unstructured":"Gabow, H.N., Kaplan, H., Tarjan, R.E.: Unique maximum matching algorithms. Journal of Algorithms\u00a040, 159\u2013183 (2001)","journal-title":"Journal of Algorithms"},{"key":"28_CR10","first-page":"373","volume":"8","author":"T. Gallai","year":"1963","unstructured":"Gallai, T.: Kritische Graphen II. Magyar Tud. Akad. Mat. Kutat\u00f3 Int. K\u00f6zl\u00a08, 373\u2013395 (1963)","journal-title":"Magyar Tud. Akad. Mat. Kutat\u00f3 Int. K\u00f6zl"},{"key":"28_CR11","doi-asserted-by":"publisher","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\u00a031, 139\u2013154 (2001)","journal-title":"Algorithmica"},{"key":"28_CR12","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1016\/0928-4931(95)00081-X","volume":"C3","author":"M.P. Groves","year":"1995","unstructured":"Groves, M.P., Carvalho, C.F., Prager, R.H.: Switching the polyacetylene soliton. Materials Science and Engineering\u00a0C3, 181\u2013185 (1995)","journal-title":"Materials Science and Engineering"},{"key":"28_CR13","doi-asserted-by":"crossref","unstructured":"Levit, V., Mandrescu, E.: Uniquely restricted maximum matchings in unicycle graphs. In: Fifth Haifa Workshop on Interdisciplinary Applications of Graph theory, Combinatorics, and Algorithms, May 16-19 (2005)","DOI":"10.1016\/j.endm.2005.06.055"},{"key":"28_CR14","volume-title":"Matching Theory","author":"L. Lov\u00e1sz","year":"1986","unstructured":"Lov\u00e1sz, L., Plummer, M.D.: Matching Theory. North Holland, Amsterdam (1986)"},{"key":"28_CR15","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1007\/BF00383169","volume":"7","author":"H. M\u00fcller","year":"1990","unstructured":"M\u00fcller, H.: Alternating cycle free matchings in chordal bipartite graph. Order\u00a07, 11\u201321 (1990)","journal-title":"Order"},{"key":"28_CR16","first-page":"420","volume-title":"Proc. of the 16th Int. Joint Conf. on Artificial Intelligence","author":"J.C. Regin","year":"1999","unstructured":"Regin, J.C.: The symmetric alldiff constraint. In: Proc. of the 16th Int. Joint Conf. on Artificial Intelligence, pp. 420\u2013425. Morgan Kaufmann, San Francisco (1999)"}],"container-title":["Lecture Notes in Computer Science","Graph-Theoretic Concepts in Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11917496_28.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T03:42:31Z","timestamp":1619494951000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11917496_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540483816","9783540483823"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/11917496_28","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}