{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:24:52Z","timestamp":1761611092828},"reference-count":21,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[1994,3,1]],"date-time":"1994-03-01T00:00:00Z","timestamp":762480000000},"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":7078,"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":[[1994,3]]},"DOI":"10.1016\/0012-365x(94)90092-2","type":"journal-article","created":{"date-parts":[[2002,10,11]],"date-time":"2002-10-11T08:43:22Z","timestamp":1034325802000},"page":"293-304","source":"Crossref","is-referenced-by-count":44,"title":["Minimal acyclic forbidden minors for the family of graphs with bounded path-width"],"prefix":"10.1016","volume":"127","author":[{"given":"Atsushi","family":"Takahashi","sequence":"first","affiliation":[]},{"given":"Shuichi","family":"Ueno","sequence":"additional","affiliation":[]},{"given":"Yoji","family":"Kajitani","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0012-365X(94)90092-2_BIB1","first-page":"325","article-title":"A Kuratowski theorem for the projective plane","volume":"7","author":"Archdeacon","year":"1983","journal-title":"J. Graph Theory"},{"key":"10.1016\/0012-365X(94)90092-2_BIB2","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1137\/0608024","article-title":"Complexity of finding embeddings in a k-tree","volume":"8","author":"Arnborg","year":"1987","journal-title":"SIAM J. Algebraic Discrete Methods"},{"key":"10.1016\/0012-365X(94)90092-2_BIB3","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0012-365X(90)90292-P","article-title":"Forbidden minors characterization of partial 3-trees","volume":"80","author":"Arnborg","year":"1990","journal-title":"Discrete Math."},{"key":"10.1016\/0012-365X(94)90092-2_BIB4","first-page":"2677","article-title":"Minimal forbidden minor characterization of planar partial 3-trees and application to circuit layout","author":"Dai","year":"1990","journal-title":"Proc. ISCAS"},{"key":"10.1016\/0012-365X(94)90092-2_BIB5","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4613-9647-5_5","article-title":"Finite-basis theorems and a computational-integrated approach to obstruction set isolation","author":"Fellows","year":"1989","journal-title":"Proceedings of Computers and Mathematics Conference"},{"key":"10.1016\/0012-365X(94)90092-2_BIB6","first-page":"501","article-title":"On search, decision and the efficiency of polynomial-time algorithms","author":"Fellows","year":"1989","journal-title":"Proc. 21st ACM Symp. on Theory of Computing"},{"key":"10.1016\/0012-365X(94)90092-2_BIB7","series-title":"Logic and Combinatorics","first-page":"229","article-title":"The metamathematics of the graph minor theorem","volume":"65","author":"Friedman","year":"1987"},{"key":"10.1016\/0012-365X(94)90092-2_BIB8","series-title":"Master's Thesis","author":"Fukuhara","year":"1990"},{"key":"10.1016\/0012-365X(94)90092-2_BIB9","doi-asserted-by":"crossref","first-page":"332","DOI":"10.1016\/0095-8956(79)90022-4","article-title":"103 graphs that are irreducible for the projective plane","volume":"27","author":"Glover","year":"1979","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/0012-365X(94)90092-2_BIB10","series-title":"Computational Graph Theory","first-page":"17","article-title":"Graph problems related to gate matrix layout and PLA folding","author":"M\u00f6hring","year":"1990"},{"key":"10.1016\/0012-365X(94)90092-2_BIB11","series-title":"Theory and Applications of Graphs","first-page":"426","article-title":"Pursuit-evasion in a graph","volume":"Vol. 642","author":"Parsons","year":"1976"},{"key":"10.1016\/0012-365X(94)90092-2_BIB12","doi-asserted-by":"crossref","first-page":"275","DOI":"10.1016\/0012-365X(84)90164-X","article-title":"Separating subgraphs in k-trees: cables and caterpillars","volume":"49","author":"Proskurowski","year":"1984","journal-title":"Discrete Math."},{"key":"10.1016\/0012-365X(94)90092-2_BIB13","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1016\/0095-8956(83)90079-5","article-title":"Graph minors","volume":"35","author":"Robertson","year":"1983","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/0012-365X(94)90092-2_BIB14","article-title":"The disjoint paths problem","volume":"XIII","author":"Robertson","year":"1986","journal-title":"Graph minors"},{"key":"10.1016\/0012-365X(94)90092-2_BIB15","article-title":"Graph minors","author":"Robertson","year":"1987","journal-title":"XVI. Wagner's conjecture"},{"key":"10.1016\/0012-365X(94)90092-2_BIB16","series-title":"Topics in Combinatorics and Graph Theory","first-page":"613","article-title":"A linear algorithm for the pathwidth of trees","author":"Scheffler","year":"1990"},{"key":"10.1016\/0012-365X(94)90092-2_BIB17","series-title":"ISA '91 Algorithms (Proc. 2nd Internat. Symp. on Algorithms, Taipei)","first-page":"61","article-title":"Mixed-searching and proper-path-width","volume":"Vol. 557","author":"Takahashi","year":"1991"},{"key":"10.1016\/0012-365X(94)90092-2_BIB18","series-title":"CAS 91-74","article-title":"On the proper-path-decomposition of trees","author":"Takahashi","year":"1991"},{"key":"10.1016\/0012-365X(94)90092-2_BIB19","article-title":"Universal graphs for graphs with bounded path-width","author":"Takahashi","year":"1991","journal-title":"SIGAL 91-24-3, IPSJ"},{"key":"10.1016\/0012-365X(94)90092-2_BIB20","first-page":"1216","article-title":"A characterization of trees contained in a generalized fan in terms of forbidden subgraphs","author":"Takeuchi","year":"1992","journal-title":"Trans. IEICE J75-A"},{"key":"10.1016\/0012-365X(94)90092-2_BIB21","doi-asserted-by":"crossref","first-page":"433","DOI":"10.1007\/BF01360256","article-title":"Bemerkung zu Hadwigers Vermutung","volume":"141","author":"Wagner","year":"1960","journal-title":"Math. Ann."}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X94900922?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X94900922?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,11]],"date-time":"2019-04-11T02:51:14Z","timestamp":1554951074000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0012365X94900922"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,3]]},"references-count":21,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1994,3]]}},"alternative-id":["0012365X94900922"],"URL":"https:\/\/doi.org\/10.1016\/0012-365x(94)90092-2","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[1994,3]]}}}