{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,7]],"date-time":"2026-06-07T08:50:23Z","timestamp":1780822223017,"version":"3.54.1"},"reference-count":7,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1997,4,1]],"date-time":"1997-04-01T00:00:00Z","timestamp":859852800000},"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":5951,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[1997,4]]},"DOI":"10.1016\/s0166-218x(96)00017-0","type":"journal-article","created":{"date-parts":[[2003,4,7]],"date-time":"2003-04-07T17:19:33Z","timestamp":1049735973000},"page":"85-92","source":"Crossref","is-referenced-by-count":21,"title":["On paths avoiding forbidden pairs of vertices in a graph"],"prefix":"10.1016","volume":"74","author":[{"given":"Hananya","family":"Yinnone","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/S0166-218X(96)00017-0_BIB1","first-page":"842","article-title":"Two theorems in graph theory","volume":"43","author":"Berge","year":"1957"},{"key":"10.1016\/S0166-218X(96)00017-0_BIB2","doi-asserted-by":"crossref","first-page":"449","DOI":"10.4153\/CJM-1965-045-4","article-title":"Paths, trees, and flowers","volume":"17","author":"Edmonds","year":"1965","journal-title":"Cand. J. Math."},{"key":"10.1016\/S0166-218X(96)00017-0_BIB3","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1109\/TSE.1976.233819","article-title":"On two problems in the generation of program test paths","volume":"SE-2","author":"Gabow","year":"1976","journal-title":"IEEE Trans. Software Engrg."},{"key":"10.1016\/S0166-218X(96)00017-0_BIB4","series-title":"Computers and Intractability: A guide to the theory of NP-Completeness","author":"Garey","year":"1979"},{"key":"10.1016\/S0166-218X(96)00017-0_BIB5","series-title":"San Francisco Annual Meeting of the AMS","first-page":"7","article-title":"On the maximal number of disjoint chains connecting given terminals in a graph","author":"Kelmans","year":"1981"},{"key":"10.1016\/S0166-218X(96)00017-0_BIB6","series-title":"Proc. 1973 IEEE Symp. Computer Software Reliability","first-page":"18","article-title":"Optimal software test planning through automated network analysis","author":"Krause","year":"1973"},{"key":"10.1016\/S0166-218X(96)00017-0_BIB7","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1016\/0166-218X(94)90007-8","article-title":"Maximum number of disjoint paths connecting specified terminals in a graph","volume":"55","author":"Yinnone","year":"1994","journal-title":"Discrete Appl. Math."}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X96000170?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X96000170?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,27]],"date-time":"2019-04-27T19:54:42Z","timestamp":1556394882000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X96000170"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,4]]},"references-count":7,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1997,4]]}},"alternative-id":["S0166218X96000170"],"URL":"https:\/\/doi.org\/10.1016\/s0166-218x(96)00017-0","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[1997,4]]}}}