{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,5]],"date-time":"2026-03-05T13:32:03Z","timestamp":1772717523865,"version":"3.50.1"},"reference-count":12,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2006,6,1]],"date-time":"2006-06-01T00:00:00Z","timestamp":1149120000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2006,6]]},"DOI":"10.1007\/s00373-005-0627-y","type":"journal-article","created":{"date-parts":[[2006,7,5]],"date-time":"2006-07-05T04:06:47Z","timestamp":1152072407000},"page":"161-172","source":"Crossref","is-referenced-by-count":68,"title":["Directed Path-width and Monotonicity in Digraph Searching"],"prefix":"10.1007","volume":"22","author":[{"given":"J\u00e1nos","family":"Bar\u00e1t","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"627_CR1","unstructured":"Adler, I.: A note on monotonicity in digraph searching. Manuscript, 2003"},{"key":"627_CR2","unstructured":"Bar\u00e1t, J.: Width-type graph parameters (PhD-Thesis). University of Szeged, Hungary, 2001"},{"key":"627_CR3","doi-asserted-by":"crossref","unstructured":"Bienstock, D., Seymour, P.: Monotonicity in Graph Searching. J. Algo. 12, 239\u2013245 (1991)","DOI":"10.1016\/0196-6774(91)90003-H"},{"key":"627_CR4","unstructured":"Bienstock, D., Robertson, N., Seymour, P., Thomas, R.: Quickly Excluding a Forest. J. Combin. Theory Ser. B 52, 274\u2013283 (1991)"},{"key":"627_CR5","unstructured":"Dendris, N.D., Kirousis, L.M., Thilikos, D.M.: Fugitive-search games on graphs and related parameters. Theoret. Comput. Sci. 172, 233\u2013254 (1997)"},{"key":"627_CR6","unstructured":"Diestel, R.: Graph Theory. Springer, 1997; xiv+289 pp. and second edition (Springer 2000) xiv+313 pp."},{"key":"627_CR7","unstructured":"Fomin, F.V., Thilikos, D.M.: On the monotonicity of games generated by symmetric submodular functions. Discrete Appl. Math. 131, 323\u2013335 (2003)"},{"key":"627_CR8","unstructured":"Johnson, T., Robertson, N., Seymour, P.D., Thomas, R.: Directed Tree-Width. J. Combin. Theory Ser. B 82, 138\u2013154 (2001)"},{"key":"627_CR9","doi-asserted-by":"crossref","unstructured":"Reed, B.: Introducing Directed Tree Width, 6th Twente Workshop on Graphs and Combinatorial Optimization (Enschede, 1999), 8 pp. (electronic), Electron. Notes Discrete Math. 3, Elsevier, Amsterdam, 1999","DOI":"10.1016\/S1571-0653(05)80061-7"},{"key":"627_CR10","unstructured":"Thomas, R.: Tree-decomposition of graphs. Class notes, 1996, http:\/\/www.math. gatech.edu\/~thomas\/tree.ps"},{"key":"627_CR11","unstructured":"Thomas, R.: Personal communication"},{"key":"627_CR12","doi-asserted-by":"crossref","unstructured":"Thomassen, C.: Even Cycles in Directed Graphs. Europ. J. Combinatorics 6, 85\u201389 (1985)","DOI":"10.1016\/S0195-6698(85)80025-1"}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-005-0627-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00373-005-0627-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-005-0627-y","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,28]],"date-time":"2019-05-28T14:58:25Z","timestamp":1559055505000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00373-005-0627-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,6]]},"references-count":12,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2006,6]]}},"alternative-id":["627"],"URL":"https:\/\/doi.org\/10.1007\/s00373-005-0627-y","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006,6]]}}}