{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,10]],"date-time":"2026-06-10T06:23:02Z","timestamp":1781072582625,"version":"3.54.1"},"reference-count":6,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1990,6,1]],"date-time":"1990-06-01T00:00:00Z","timestamp":644198400000},"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":8447,"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":[[1990,6]]},"DOI":"10.1016\/0095-8956(90)90063-6","type":"journal-article","created":{"date-parts":[[2005,2,9]],"date-time":"2005-02-09T09:37:08Z","timestamp":1107941828000},"page":"40-77","source":"Crossref","is-referenced-by-count":69,"title":["Graph minors. IX. Disjoint crossed paths"],"prefix":"10.1016","volume":"49","author":[{"given":"Neil","family":"Robertson","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"P.D","family":"Seymour","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/0095-8956(90)90063-6_BIB1","first-page":"463","article-title":"A combinatorial problem in geometry","volume":"2","author":"Erd\u0151s","year":"1935","journal-title":"Compositio Math."},{"key":"10.1016\/0095-8956(90)90063-6_BIB2","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1016\/0095-8956(84)90013-3","article-title":"Graph minors. III. Planar tree-width","volume":"36","author":"Robertson","year":"1984","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/0095-8956(90)90063-6_BIB3","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1016\/S0195-6698(86)80043-9","article-title":"Adjacency in binary matroids","volume":"7","author":"Seymour","year":"1986","journal-title":"European J. Combin."},{"key":"10.1016\/0095-8956(90)90063-6_BIB4","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1016\/0012-365X(80)90158-2","article-title":"Disjoint paths in graphs","volume":"29","author":"Seymour","year":"1980","journal-title":"Discrete Math."},{"key":"10.1016\/0095-8956(90)90063-6_BIB5","doi-asserted-by":"crossref","first-page":"445","DOI":"10.1145\/322203.322207","article-title":"A polynomial solution to the undirected two paths problem","volume":"27","author":"Shiloach","year":"1980","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/0095-8956(90)90063-6_BIB6","doi-asserted-by":"crossref","first-page":"371","DOI":"10.1016\/S0195-6698(80)80039-4","article-title":"2-linked graphs","volume":"1","author":"Thomassen","year":"1980","journal-title":"European J. Combin."}],"container-title":["Journal of Combinatorial Theory, Series B"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0095895690900636?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0095895690900636?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,1,29]],"date-time":"2019-01-29T10:52:25Z","timestamp":1548759145000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0095895690900636"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1990,6]]},"references-count":6,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1990,6]]}},"alternative-id":["0095895690900636"],"URL":"https:\/\/doi.org\/10.1016\/0095-8956(90)90063-6","relation":{},"ISSN":["0095-8956"],"issn-type":[{"value":"0095-8956","type":"print"}],"subject":[],"published":{"date-parts":[[1990,6]]}}}