{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,8]],"date-time":"2026-04-08T04:55:21Z","timestamp":1775624121398,"version":"3.50.1"},"reference-count":21,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[1991,12,1]],"date-time":"1991-12-01T00:00:00Z","timestamp":691545600000},"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":7899,"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":[[1991,12]]},"DOI":"10.1016\/0012-365x(91)90343-z","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:43:43Z","timestamp":1027655023000},"page":"303-319","source":"Crossref","is-referenced-by-count":13,"title":["Excluding infinite minors"],"prefix":"10.1016","volume":"95","author":[{"given":"Neil","family":"Robertson","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Paul","family":"Seymour","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Robin","family":"Thomas","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0012-365X(91)90343-Z_BIB1","doi-asserted-by":"crossref","first-page":"274","DOI":"10.1016\/0095-8956(91)90068-U","article-title":"Quickly excluding a forest","volume":"52","author":"Bienstock","year":"1991","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/0012-365X(91)90343-Z_BIB2","unstructured":"R. Diestel, The structure of TKa-free graphs, submitted."},{"key":"10.1016\/0012-365X(91)90343-Z_BIB3","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1002\/mana.19660310110","article-title":"Graphen ohne unendliche Wege","volume":"31","author":"Halin","year":"1966","journal-title":"Math Nachr."},{"key":"10.1016\/0012-365X(91)90343-Z_BIB4","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1002\/mana.19650300106","article-title":"\u00dcber die Maximalzahl fremder unendlicher Wege in Graphen","volume":"30","author":"Halin","year":"1965","journal-title":"Math. Nachr."},{"key":"10.1016\/0012-365X(91)90343-Z_BIB5","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1002\/mana.19670350503","article-title":"Zusammenz\u00fcge und Unterteilungen von Graphen","volume":"35","author":"Jung","year":"1967","journal-title":"Math. Nachr."},{"key":"10.1016\/0012-365X(91)90343-Z_BIB6","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1016\/0012-365X(85)90046-9","article-title":"Interval graphs and searching","volume":"55","author":"Kirousis","year":"1985","journal-title":"Discrete Math."},{"key":"10.1016\/0012-365X(91)90343-Z_BIB7","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1016\/0012-365X(90)90150-G","article-title":"Clique-sums, tree-decompositions and compactness","volume":"81","author":"K\u0159\u00ed\u017e","year":"1990","journal-title":"Discrete Math."},{"key":"10.1016\/0012-365X(91)90343-Z_BIB8","doi-asserted-by":"crossref","first-page":"86","DOI":"10.1016\/0095-8956(91)90093-Y","article-title":"The Menger-like property of tree-width of infinite graphs and related compactness results","volume":"52","author":"K\u0159\u00ed\u017e","year":"1991","journal-title":"J. Combin. Theory"},{"key":"10.1016\/0012-365X(91)90343-Z_BIB9","author":"La Paugh","year":"1982","journal-title":"Recontamination does not help to search a graph"},{"key":"10.1016\/0012-365X(91)90343-Z_BIB10","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1016\/0095-8956(83)90079-5","article-title":"Graph minors I. Excluding a forest","volume":"35","author":"Robertson","year":"1983","journal-title":"J. Combin. Theory Ser. B."},{"key":"10.1016\/0012-365X(91)90343-Z_BIB11","doi-asserted-by":"crossref","first-page":"92","DOI":"10.1016\/0095-8956(86)90030-4","article-title":"Graph minors V. Excluding a planar graph","volume":"41","author":"Robertson","year":"1986","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/0012-365X(91)90343-Z_BIB12","unstructured":"N. Robertson and P.D. Seymour, Graph minors XV. Wagner's conjecture, manuscript."},{"key":"10.1016\/0012-365X(91)90343-Z_BIB13","unstructured":"N. Robertson and P.D. Seymour, Graph minors XVI. Well-quasi-ordering on a surface, manuscript."},{"key":"10.1016\/0012-365X(91)90343-Z_BIB14","unstructured":"N. Robertson, P.D. Seymour and R. Thomas, Excluding infinite clique minors, manuscript."},{"key":"10.1016\/0012-365X(91)90343-Z_BIB15","doi-asserted-by":"crossref","unstructured":"N. Robertson, P.D. Seymour and R. Thomas, Excluding infinite clique subdivisions, Trans. Amer. Math. Soc., to appear.","DOI":"10.1090\/S0002-9947-1992-1079057-3"},{"key":"10.1016\/0012-365X(91)90343-Z_BIB16","unstructured":"N. Robertson, P.D. Seymour and R. Thomas, Quickly excluding a planar graph, submitted."},{"key":"10.1016\/0012-365X(91)90343-Z_BIB17","doi-asserted-by":"crossref","unstructured":"P.D. Seymour and R. Thomas, Excluding infinite trees, Trans. Amer. Math. Soc., to appear.","DOI":"10.1090\/S0002-9947-1993-1079058-6"},{"key":"10.1016\/0012-365X(91)90343-Z_BIB18","unstructured":"P.D. Seymour and R. Thomas, Graph searching, and a minimax theorem for tree-width, submitted."},{"key":"10.1016\/0012-365X(91)90343-Z_BIB19","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1017\/S0305004100064616","article-title":"A counterexample to Wagner's conjecture for infinite graphs","volume":"103","author":"Thomas","year":"1988","journal-title":"Math. Proc. Cambridge Philos. Soc."},{"key":"10.1016\/0012-365X(91)90343-Z_BIB20","series-title":"Combinatorial Mathematics","first-page":"402","article-title":"Configurations in graphs of large minimum degree, connectivity or chromatic number","volume":"Vol. 555","author":"Thomassen","year":"1989"},{"key":"10.1016\/0012-365X(91)90343-Z_BIB21","author":"Seese","year":"1988","journal-title":"Ordered tree representations of infinite graphs"}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X9190343Z?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X9190343Z?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T06:23:00Z","timestamp":1555136580000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0012365X9190343Z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991,12]]},"references-count":21,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1991,12]]}},"alternative-id":["0012365X9190343Z"],"URL":"https:\/\/doi.org\/10.1016\/0012-365x(91)90343-z","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[1991,12]]}}}