{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,31]],"date-time":"2022-03-31T15:17:13Z","timestamp":1648739833575},"reference-count":14,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[1998,3,1]],"date-time":"1998-03-01T00:00:00Z","timestamp":888710400000},"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":5617,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Mathematics"],"published-print":{"date-parts":[[1998,3]]},"DOI":"10.1016\/s0012-365x(97)83079-8","type":"journal-article","created":{"date-parts":[[2003,4,30]],"date-time":"2003-04-30T18:23:46Z","timestamp":1051727026000},"page":"29-51","source":"Crossref","is-referenced-by-count":0,"title":["The obstructions of a minor-closed set of graphs defined by a context-free grammar"],"prefix":"10.1016","volume":"182","author":[{"given":"B","family":"Courcelle","sequence":"first","affiliation":[]},{"given":"G","family":"S\u00e9nizergues","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0012-365X(97)83079-8_BIB1","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1007\/BF01692060","article-title":"Graph expressions and graph rewritings","volume":"20","author":"Bauderon","year":"1987","journal-title":"Math. Syst. Theory"},{"key":"10.1016\/S0012-365X(97)83079-8_BIB2","doi-asserted-by":"crossref","first-page":"12","DOI":"10.1016\/0890-5401(90)90043-H","article-title":"The monadic second-order logic of graphs I: recognizable sets of finite graphs","volume":"85","author":"Courcelle","year":"1990","journal-title":"Inform. Comput."},{"key":"10.1016\/S0012-365X(97)83079-8_BIB3","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1016\/0304-3975(91)90387-H","article-title":"The monadic second-order logic of graphs V: on closing the gap between definability and recognizability","volume":"80","author":"Courcelle","year":"1991","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0012-365X(97)83079-8_BIB4","first-page":"178","article-title":"On constructing obstruction sets of words","volume":"44","author":"Courcelle","year":"1991","journal-title":"Bull. EATCS"},{"key":"10.1016\/S0012-365X(97)83079-8_BIB5","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1051\/ita\/1992260302571","article-title":"The monadic second-order logic of graphs III: tree decompositions, minors and complexity issues","volume":"26","author":"Courcelle","year":"1992","journal-title":"RAIRO Inform. Th\u00e9or. Appl."},{"key":"10.1016\/S0012-365X(97)83079-8_BIB6","series-title":"Graph Structure Theory","first-page":"565","article-title":"Graph grammars, monadic second-order logic and the theory of graph minors","volume":"Vol. 147","author":"Courcelle","year":"1993"},{"key":"10.1016\/S0012-365X(97)83079-8_BIB7","first-page":"313","article-title":"The expression of graph properties and graph transformations in monadic second-order logic","volume":"vol. 1","author":"Courcelle","year":"1996"},{"key":"10.1016\/S0012-365X(97)83079-8_BIB8","series-title":"Proc. 30th Symp. FOCS","first-page":"520","article-title":"An analogue of the Myhill-Nerode theorem and its use in computing finite basis characterizations","author":"Fellows","year":"1989"},{"key":"10.1016\/S0012-365X(97)83079-8_BIB9","article-title":"Hyperedge Replacement: Grammars and languages","volume":"vol. 643","author":"Habel","year":"1993"},{"key":"10.1016\/S0012-365X(97)83079-8_BIB10","series-title":"Introduction to Formal Language Theory","author":"Harrison","year":"1978"},{"key":"10.1016\/S0012-365X(97)83079-8_BIB11","series-title":"Graph minors XX: Wagner's conjecture","author":"Robertson","year":"1988"},{"key":"10.1016\/S0012-365X(97)83079-8_BIB12","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1006\/jctb.1994.1073","article-title":"Quickly excluding a planar graph","volume":"62","author":"Robertson","year":"1994","journal-title":"J. Combin. Theory B"},{"key":"10.1016\/S0012-365X(97)83079-8_BIB13","unstructured":"D. Sanders, 1995, private communication."},{"key":"10.1016\/S0012-365X(97)83079-8_BIB14","doi-asserted-by":"crossref","first-page":"298","DOI":"10.1137\/0211023","article-title":"The recognition of series-parallel graphs","volume":"11","author":"Vald\u00e8s","year":"1982","journal-title":"SIAM J. Comput."}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X97830798?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X97830798?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,27]],"date-time":"2019-04-27T07:50:12Z","timestamp":1556351412000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0012365X97830798"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,3]]},"references-count":14,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1998,3]]}},"alternative-id":["S0012365X97830798"],"URL":"https:\/\/doi.org\/10.1016\/s0012-365x(97)83079-8","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[1998,3]]}}}