{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T03:26:39Z","timestamp":1763436399021},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540542339"},{"type":"electronic","value":"9783540475163"}],"license":[{"start":{"date-parts":[[1991,1,1]],"date-time":"1991-01-01T00:00:00Z","timestamp":662688000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1991]]},"DOI":"10.1007\/3-540-54233-7_161","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T22:38:24Z","timestamp":1330209504000},"page":"532-543","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":27,"title":["Finding minimal forbidden minors using a finite congruence"],"prefix":"10.1007","author":[{"given":"Jens","family":"Lagergren","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Stefan","family":"Arnborg","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,8]]},"reference":[{"key":"41_CR1","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1137\/0608024","volume":"8","author":"S. Arnborg","year":"1987","unstructured":"S. Arnborg, D.G. Corneil, and A. Proskurowski. Complexity of finding embeddings in a k-tree. SIAM J. Alg. and Discr. Methods, 8:277\u2013284, 1987.","journal-title":"SIAM J. Alg. and Discr. Methods"},{"key":"41_CR2","unstructured":"S. Arnborg, B. Courcelle, A. Proskurowski, and D. Seese. An algebraic theory of graph reduction. Technical Report LaBRI-90-02, Universite de Bordeaux, Jan. 1990."},{"key":"41_CR3","doi-asserted-by":"crossref","unstructured":"S. Arnborg, A. Proskurowski, and D. Seese. Monadic second order logic, tree automata and forbidden minors. Manuscript, 1990.","DOI":"10.1007\/3-540-54487-9_49"},{"key":"41_CR4","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1007\/BF01692060","volume":"20","author":"M. Bauderon","year":"1987","unstructured":"M. Bauderon and B. Courcelle. Graph expressions and graph rewritings. Mathematical Systems Theory, 20:83\u2013127, 1987.","journal-title":"Mathematical Systems Theory"},{"key":"41_CR5","unstructured":"J.A. Bondy and U.S.R. Murty. Graph Theory with Applications. North-Holland, 1979."},{"key":"41_CR6","doi-asserted-by":"crossref","first-page":"12","DOI":"10.1016\/0890-5401(90)90043-H","volume":"85","author":"B. Courcelle","year":"1990","unstructured":"B. Courcelle. The monadic second order logic of graphs I: Recognizable sets of finite graphs. Information and Computation, 85:12\u201375, March 1990.","journal-title":"Information and Computation"},{"key":"41_CR7","doi-asserted-by":"crossref","unstructured":"M. Fellows and M. Langston. An analogue of the myhill-nerode theorem and its use in computing finite basis characterizations. In IEEE FoCS, pages 520\u2013525, 1989.","DOI":"10.1109\/SFCS.1989.63528"},{"key":"41_CR8","unstructured":"N. Robertson and P.D. Seymour. Graph minors XIV, Wagners conjecture. preprint, 1986."},{"key":"41_CR9","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1007\/BF01691346","volume":"2","author":"J.W. Thatcher","year":"1968","unstructured":"J.W. Thatcher and J.B. Wright. Generalized finite automata theory with an application to a decision problem in second-order logic. Mathematical Systems Theory, 2:57\u201381, 1968.","journal-title":"Mathematical Systems Theory"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-54233-7_161","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T12:40:14Z","timestamp":1558269614000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-54233-7_161"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991]]},"ISBN":["9783540542339","9783540475163"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/3-540-54233-7_161","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1991]]},"assertion":[{"value":"8 June 2005","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}