{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T03:05:52Z","timestamp":1740107152340,"version":"3.37.3"},"reference-count":11,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2019,9,7]],"date-time":"2019-09-07T00:00:00Z","timestamp":1567814400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2019,9,7]],"date-time":"2019-09-07T00:00:00Z","timestamp":1567814400000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001691","name":"Japan Society for the Promotion of Science","doi-asserted-by":"publisher","award":["15K00007"],"award-info":[{"award-number":["15K00007"]}],"id":[{"id":"10.13039\/501100001691","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2020,3]]},"DOI":"10.1007\/s00373-019-02085-4","type":"journal-article","created":{"date-parts":[[2019,9,7]],"date-time":"2019-09-07T05:55:03Z","timestamp":1567835703000},"page":"319-330","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Tangle and Ultrafilter: Game Theoretical Interpretation"],"prefix":"10.1007","volume":"36","author":[{"given":"Takaaki","family":"Fujita","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4293-8676","authenticated-orcid":false,"given":"Koichi","family":"Yamazaki","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,9,7]]},"reference":[{"issue":"4","key":"2085_CR1","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1002\/jgt.20025","volume":"47","author":"I Adler","year":"2004","unstructured":"Adler, I.: Marshals, monotone marshals, and hypertree-width. J. Graph Theory 47(4), 275\u2013296 (2004)","journal-title":"J. Graph Theory"},{"issue":"3","key":"2085_CR2","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1016\/j.jctb.2013.03.002","volume":"103","author":"B Clark","year":"2013","unstructured":"Clark, B., Whittle, G.: Tangles, trees, and flowers. J. Comb. Theory Ser. B 103(3), 385\u2013407 (2013)","journal-title":"J. Comb. Theory Ser. B"},{"key":"2085_CR3","unstructured":"Diestel, R.: Ends and tangles (2015). arXiv preprint \narXiv:1510.04050v2"},{"key":"2085_CR4","unstructured":"Diestel, R., Oum, S.I.: Unifying duality theorems for width parameters in graphs and matroids. I. Weak and strong duality (2014). arXiv preprint \narXiv:1406.3797"},{"issue":"4","key":"2085_CR5","doi-asserted-by":"publisher","first-page":"560","DOI":"10.1016\/j.jctb.2005.11.001","volume":"96","author":"J Geelen","year":"2006","unstructured":"Geelen, J., Gerards, B., Robertson, N., Whittle, G.: Obstructions to branch-decomposition of matroids. J. Comb. Theory Ser. B 96(4), 560\u2013570 (2006)","journal-title":"J. Comb. Theory Ser. B"},{"key":"2085_CR6","unstructured":"Grohe, M.: Tangled up in blue (a survey on connectivity, decompositions, and tangles) (2016). arXiv preprint \narXiv:1605.06704"},{"key":"2085_CR7","first-page":"87","volume":"241","author":"B Reed","year":"1997","unstructured":"Reed, B.: Tree width and tangles: a new connectivity measure and some applications. Surv. Comb. 241, 87\u2013162 (1997)","journal-title":"Surv. Comb."},{"issue":"2","key":"2085_CR8","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1016\/0095-8956(91)90061-N","volume":"52","author":"N Robertson","year":"1991","unstructured":"Robertson, N., Seymour, P.D.: Graph minors. X. Obstructions to tree-decomposition. J. Comb. Theory Ser. B 52(2), 153\u2013190 (1991)","journal-title":"J. Comb. Theory Ser. B"},{"issue":"1","key":"2085_CR9","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1006\/jctb.1993.1027","volume":"58","author":"PD Seymour","year":"1993","unstructured":"Seymour, P.D., Thomas, R.: Graph searching and a min-max theorem for tree-width. J. Comb. Theory Ser. B 58(1), 22\u201333 (1993)","journal-title":"J. Comb. Theory Ser. B"},{"key":"2085_CR10","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-85820-8","volume-title":"Boolean Algebras","author":"R Sikorski","year":"1969","unstructured":"Sikorski, R.: Boolean Algebras, 3rd edn. Springer, Berlin (1969)","edition":"3"},{"key":"2085_CR11","doi-asserted-by":"crossref","unstructured":"Yamazaki, K.: Tangle and maximal ideal. In: Algorithms and Computation, 11th International Conference and Workshops, WALCOM 2017, Lecture Notes in Computer Science, vol. 10167, pp. 81\u201392. Springer (2017)","DOI":"10.1007\/978-3-319-53925-6_7"}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-019-02085-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00373-019-02085-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-019-02085-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,9,6]],"date-time":"2020-09-06T00:01:54Z","timestamp":1599350514000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00373-019-02085-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,9,7]]},"references-count":11,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2020,3]]}},"alternative-id":["2085"],"URL":"https:\/\/doi.org\/10.1007\/s00373-019-02085-4","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"type":"print","value":"0911-0119"},{"type":"electronic","value":"1435-5914"}],"subject":[],"published":{"date-parts":[[2019,9,7]]},"assertion":[{"value":"5 January 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 December 2018","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 September 2019","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}