{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,20]],"date-time":"2025-06-20T16:25:51Z","timestamp":1750436751872},"reference-count":12,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[2003,4,1]],"date-time":"2003-04-01T00:00:00Z","timestamp":1049155200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":3760,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2003,4]]},"DOI":"10.1016\/s0304-3975(02)00048-8","type":"journal-article","created":{"date-parts":[[2003,4,23]],"date-time":"2003-04-23T23:53:40Z","timestamp":1051142020000},"page":"179-210","source":"Crossref","is-referenced-by-count":9,"title":["Structuring the elementary components of graphs having a perfect internal matching"],"prefix":"10.1016","volume":"299","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":"78","reference":[{"key":"10.1016\/S0304-3975(02)00048-8_BIB1","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1016\/0020-0190(91)90196-O","article-title":"A structure theorem for maximum internal matchings in graphs","volume":"40","author":"Bartha","year":"1991","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/S0304-3975(02)00048-8_BIB2","unstructured":"M. Bartha, E. Gomb\u00e1s, The Gallai-Edmonds algebra of graphs, Research Report # 9105, Department of Computer Science, Memorial University, St. John's, Canada, 1991."},{"key":"10.1016\/S0304-3975(02)00048-8_BIB3","first-page":"111","article-title":"On graphs with perfect internal matchings","volume":"12","author":"Bartha","year":"1995","journal-title":"Acta Cybernet."},{"key":"10.1016\/S0304-3975(02)00048-8_BIB4","unstructured":"M. Bartha, H. J\u00fcrgensen, Characterizing finite undirected multigraphs as indexed algebras, Research Report # 252, Department of Computer Science, The University of Western Ontario, London, Canada, 1989."},{"key":"10.1016\/S0304-3975(02)00048-8_BIB5","first-page":"631","article-title":"Elementary decomposition of soliton automata","volume":"14","author":"Bartha","year":"2000","journal-title":"Acta Cybernet."},{"key":"10.1016\/S0304-3975(02)00048-8_BIB6","series-title":"Molecular Electronic Devices","first-page":"51","article-title":"Comformational switching at the molecular level","author":"Carter","year":"1982"},{"key":"10.1016\/S0304-3975(02)00048-8_BIB7","doi-asserted-by":"crossref","first-page":"154","DOI":"10.1016\/0022-0000(90)90010-I","article-title":"Soliton automata","volume":"40","author":"Dassow","year":"1990","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/S0304-3975(02)00048-8_BIB8","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1016\/0304-3975(91)90164-W","article-title":"Soliton automata with a single exterior node","volume":"84","author":"Dassow","year":"1991","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(02)00048-8_BIB9","unstructured":"J. Dassow, H. J\u00fcrgensen, The transition monoids of soliton trees, Research Report # 331, Department of Computer Science, The University of Western Ontario, London, Canada, 1992."},{"key":"10.1016\/S0304-3975(02)00048-8_BIB10","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1016\/0022-0000(93)90002-E","article-title":"Soliton automata with at most one cycle","volume":"46","author":"Dassow","year":"1993","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/S0304-3975(02)00048-8_BIB11","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1016\/0304-3975(90)90135-5","article-title":"Automata represented by products of soliton automata","volume":"74","author":"G\u00e9cseg","year":"1990","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(02)00048-8_BIB12","series-title":"Matching Theory","author":"Lov\u00e1sz","year":"1986"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397502000488?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397502000488?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,5,1]],"date-time":"2019-05-01T13:52:39Z","timestamp":1556718759000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397502000488"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,4]]},"references-count":12,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[2003,4]]}},"alternative-id":["S0304397502000488"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(02)00048-8","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2003,4]]}}}