{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,21]],"date-time":"2026-01-21T19:29:34Z","timestamp":1769023774594,"version":"3.49.0"},"reference-count":3,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[2003,9,1]],"date-time":"2003-09-01T00:00:00Z","timestamp":1062374400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,8,22]],"date-time":"2013-08-22T00:00:00Z","timestamp":1377129600000},"content-version":"vor","delay-in-days":3643,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Combinatorial Theory, Series B"],"published-print":{"date-parts":[[2003,9]]},"DOI":"10.1016\/s0095-8956(03)00067-4","type":"journal-article","created":{"date-parts":[[2003,7,31]],"date-time":"2003-07-31T23:55:57Z","timestamp":1059695757000},"page":"77-108","source":"Crossref","is-referenced-by-count":14,"title":["Graph Minors. XVIII. Tree-decompositions and well-quasi-ordering"],"prefix":"10.1016","volume":"89","author":[{"given":"Neil","family":"Robertson","sequence":"first","affiliation":[]},{"given":"Paul","family":"Seymour","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0095-8956(03)00067-4_BIB1","unstructured":"C. St. J. A. Nash-Williams, On well-quasi-ordering trees, Theory of Graphs and its Applications (Proc. Symp. Smolenice, 1963), Publ. House Czechoslovak Acad. Sci., 1964, pp. 83\u201384."},{"key":"10.1016\/S0095-8956(03)00067-4_BIB2","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1016\/0095-8956(90)90120-O","article-title":"Graph Minors. IV. Tree-width and well-quasi-ordering","volume":"48","author":"Robertson","year":"1990","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/S0095-8956(03)00067-4_BIB3","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1016\/0095-8956(91)90061-N","article-title":"Graph Minors. X. Obstructions to tree-decomposition","volume":"52","author":"Robertson","year":"1991","journal-title":"J. Combin. Theory Ser. B"}],"container-title":["Journal of Combinatorial Theory, Series B"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0095895603000674?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0095895603000674?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,17]],"date-time":"2019-03-17T06:20:39Z","timestamp":1552803639000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0095895603000674"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,9]]},"references-count":3,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2003,9]]}},"alternative-id":["S0095895603000674"],"URL":"https:\/\/doi.org\/10.1016\/s0095-8956(03)00067-4","relation":{},"ISSN":["0095-8956"],"issn-type":[{"value":"0095-8956","type":"print"}],"subject":[],"published":{"date-parts":[[2003,9]]}}}