{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,9]],"date-time":"2026-04-09T12:37:23Z","timestamp":1775738243233,"version":"3.50.1"},"reference-count":4,"publisher":"Elsevier BV","issue":"2-3","license":[{"start":{"date-parts":[[1983,1,1]],"date-time":"1983-01-01T00:00:00Z","timestamp":410227200000},"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":11155,"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":[[1983]]},"DOI":"10.1016\/0012-365x(83)90160-7","type":"journal-article","created":{"date-parts":[[2002,9,17]],"date-time":"2002-09-17T17:00:52Z","timestamp":1032282052000},"page":"235-239","source":"Crossref","is-referenced-by-count":366,"title":["Vertex-to-vertex pursuit in a graph"],"prefix":"10.1016","volume":"43","author":[{"given":"Richard","family":"Nowakowski","sequence":"first","affiliation":[]},{"given":"Peter","family":"Winkler","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0012-365X(83)90160-7_BIB1","article-title":"Crowns, fences and dismantlable lattices","volume":"24","author":"Kelly","year":"1974","journal-title":"Canad. J. Math."},{"key":"10.1016\/0012-365X(83)90160-7_BIB2","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1016\/0012-365X(83)90159-0","article-title":"The smallest graph variety containing all paths","volume":"43","author":"Nowakowski","year":"1983","journal-title":"Discrete Math."},{"key":"10.1016\/0012-365X(83)90160-7_BIB3","series-title":"Theory and Applications of Graphs","first-page":"426","article-title":"Pursuit-evasion in a graph","volume":"642","author":"Parsons","year":"1978"},{"key":"10.1016\/0012-365X(83)90160-7_BIB4","doi-asserted-by":"crossref","DOI":"10.1016\/S0021-9800(66)80005-4","article-title":"Graphs and composite games","volume":"1","author":"Smith","year":"1966","journal-title":"J. Combin. Theory"}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X83901607?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X83901607?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,9]],"date-time":"2019-04-09T16:24:03Z","timestamp":1554827043000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0012365X83901607"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1983]]},"references-count":4,"journal-issue":{"issue":"2-3","published-print":{"date-parts":[[1983]]}},"alternative-id":["0012365X83901607"],"URL":"https:\/\/doi.org\/10.1016\/0012-365x(83)90160-7","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[1983]]}}}