{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,8]],"date-time":"2026-04-08T04:23:58Z","timestamp":1775622238147,"version":"3.50.1"},"reference-count":5,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2010,7,1]],"date-time":"2010-07-01T00:00:00Z","timestamp":1277942400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Combinatorica"],"published-print":{"date-parts":[[2010,7]]},"DOI":"10.1007\/s00493-010-2334-4","type":"journal-article","created":{"date-parts":[[2010,10,13]],"date-time":"2010-10-13T21:24:30Z","timestamp":1287005070000},"page":"387-417","source":"Crossref","is-referenced-by-count":45,"title":["The three-in-a-tree problem"],"prefix":"10.1007","volume":"30","author":[{"given":"Maria","family":"Chudnovsky","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Paul","family":"Seymour","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2010,10,13]]},"reference":[{"key":"2334_CR1","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1016\/0012-365X(91)90098-M","volume":"90","author":"D. Bienstock","year":"1991","unstructured":"D. Bienstock: On the complexity of testing for even holes and induced odd paths, Discrete Math. 90 (1991), 85\u201392. Corrigendum: 102 (1992), 109.","journal-title":"Discrete Math."},{"key":"2334_CR2","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1137\/060672613","volume":"22","author":"M. Chudnovsky","year":"2008","unstructured":"M. Chudnovsky and R. Kapadia: Detecting a theta or a prism, SIAM J. Discrete Math. 22 (2008), 1\u201318.","journal-title":"SIAM J. Discrete Math."},{"issue":"2","key":"2334_CR3","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1007\/s00493-005-0012-8","volume":"25","author":"M. Chudnovsky","year":"2005","unstructured":"M. Chudnovsky, G. Cornu\u00e9jols, X. Liu, P. Seymour and K. Vu\u0161kovi\u0107: Recognizing Berge graphs, Combinatorica 25(2) (2005), 143\u2013186.","journal-title":"Combinatorica"},{"key":"2334_CR4","unstructured":"R. Kapadia: Detecting a Theta or a Prism, Senior Thesis, Princeton, May 2006."},{"key":"2334_CR5","doi-asserted-by":"crossref","first-page":"553","DOI":"10.1137\/S0895480104442522","volume":"19","author":"F. Maffray","year":"2005","unstructured":"F. Maffray and N. Trotignon: Algorithms for perfectly contractile graphs, SIAM J. Discrete Math. 19 (2005), 553\u2013574.","journal-title":"SIAM J. Discrete Math."}],"container-title":["Combinatorica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00493-010-2334-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00493-010-2334-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00493-010-2334-4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,28]],"date-time":"2019-05-28T21:32:46Z","timestamp":1559079166000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00493-010-2334-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,7]]},"references-count":5,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2010,7]]}},"alternative-id":["2334"],"URL":"https:\/\/doi.org\/10.1007\/s00493-010-2334-4","relation":{},"ISSN":["0209-9683","1439-6912"],"issn-type":[{"value":"0209-9683","type":"print"},{"value":"1439-6912","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,7]]}}}