{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,3]],"date-time":"2026-05-03T12:56:03Z","timestamp":1777812963783,"version":"3.51.4"},"reference-count":19,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T00:00:00Z","timestamp":1780272000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T00:00:00Z","timestamp":1780272000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T00:00:00Z","timestamp":1780272000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T00:00:00Z","timestamp":1780272000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T00:00:00Z","timestamp":1780272000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T00:00:00Z","timestamp":1780272000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T00:00:00Z","timestamp":1780272000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"funder":[{"DOI":"10.13039\/501100024370","name":"MIUR","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100024370","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100002850","name":"Fondo Nacional de Desarrollo Cient\u00edfico y Tecnol\u00f3gico","doi-asserted-by":"publisher","award":["Chile1230469"],"award-info":[{"award-number":["Chile1230469"]}],"id":[{"id":"10.13039\/501100002850","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100002850","name":"Fondo Nacional de Desarrollo Cient\u00edfico y Tecnol\u00f3gico","doi-asserted-by":"publisher","award":["1230469"],"award-info":[{"award-number":["1230469"]}],"id":[{"id":"10.13039\/501100002850","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100009045","name":"Uniwersytet Jagiello\u0144ski Collegium Medicum","doi-asserted-by":"publisher","award":["2022BXH4R5"],"award-info":[{"award-number":["2022BXH4R5"]}],"id":[{"id":"10.13039\/100009045","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003407","name":"Ministero dell\u2019Istruzione, dell\u2019Universit\u00e0 e della Ricerca","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100003407","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100007088","name":"Jagiellonian University in Krak\u00f3w","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100007088","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100020884","name":"National Agency for Research and Development","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100020884","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100021856","name":"Ministero dell'Universit\u00e0 e della Ricerca","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100021856","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[2026,6]]},"DOI":"10.1016\/j.dam.2026.02.004","type":"journal-article","created":{"date-parts":[[2026,2,10]],"date-time":"2026-02-10T07:58:32Z","timestamp":1770710312000},"page":"139-155","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["Paths, ends and the separation problem for infinite graphs"],"prefix":"10.1016","volume":"386","author":[{"ORCID":"https:\/\/orcid.org\/0009-0002-7381-4382","authenticated-orcid":false,"given":"Nicanor","family":"Carrasco-Vargas","sequence":"first","affiliation":[]},{"given":"Valentino","family":"Delle Rose","sequence":"additional","affiliation":[]},{"given":"Crist\u00f3bal","family":"Rojas","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.dam.2026.02.004_b1","doi-asserted-by":"crossref","DOI":"10.37236\/13065","article-title":"Self-avoiding walks on cayley graphs through the lens of symbolic dynamics","author":"Aubrun","year":"2024","journal-title":"Electron. J. Comb."},{"issue":"2","key":"10.1016\/j.dam.2026.02.004_b2","doi-asserted-by":"crossref","first-page":"469","DOI":"10.2307\/2272247","article-title":"Effective coloration","volume":"41","author":"Bean","year":"1976","journal-title":"J. Symb. Log."},{"key":"10.1016\/j.dam.2026.02.004_b3","doi-asserted-by":"crossref","first-page":"385","DOI":"10.1090\/S0002-9939-1976-0416888-0","article-title":"Recursive Euler and Hamilton paths","volume":"55","author":"Bean","year":"1976","journal-title":"Proc. Amer. Math. Soc."},{"key":"10.1016\/j.dam.2026.02.004_b4","doi-asserted-by":"crossref","unstructured":"N. Carrasco-Vargas, Infinite Eulerian paths are computable on graphs with vertices of infinite degree, Computability 14, 95\u2013110.","DOI":"10.1177\/22113568251359095"},{"key":"10.1016\/j.dam.2026.02.004_b5","doi-asserted-by":"crossref","DOI":"10.4171\/ggd\/817","article-title":"Translation-like actions by Z, the subgroup membership problem, and medvedev degrees of effective subshifts","author":"Carrasco-Vargas","year":"2024","journal-title":"Groups Geom. Dyn."},{"issue":"1","key":"10.1016\/j.dam.2026.02.004_b6","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1016\/S0095-8956(02)00034-5","article-title":"Graph-theoretical versus topological ends of graphs","volume":"87","author":"Diestel","year":"2003","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/j.dam.2026.02.004_b7","article-title":"Geometric group theory","volume":"vol. 63","author":"Dru\u0163u","year":"2018"},{"issue":"1\u20134","key":"10.1016\/j.dam.2026.02.004_b8","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1002\/sapm193817159","article-title":"\u00dcber Euler-linien unendlicher graphen","volume":"17","author":"Erd\u0151s","year":"1938","journal-title":"J. Math. Phys."},{"key":"10.1016\/j.dam.2026.02.004_b9","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1007\/BF02218750","article-title":"On a hierarchy of sets. I","volume":"7","author":"Ershov","year":"1968","journal-title":"Algebra Log."},{"key":"10.1016\/j.dam.2026.02.004_b10","first-page":"128","article-title":"Solutio problematis ad geometriam situs pertinentis","volume":"8","author":"Euler","year":"1741","journal-title":"Comment. Acad. Sci. Petropolitanae"},{"key":"10.1016\/j.dam.2026.02.004_b11","series-title":"Proceedings of the 35th Annual ACM\/IEEE Symposium on Logic in Computer Science","first-page":"21","article-title":"Automatic structures: Twenty years later","author":"Gr\u00e4del","year":"2020"},{"issue":"1","key":"10.1016\/j.dam.2026.02.004_b12","doi-asserted-by":"crossref","first-page":"30","DOI":"10.1007\/BF01442866","article-title":"\u00dcber die M\u00f6glichkeit, einen Linienzug ohne Wiederholung und ohne Unterbrechung zu umfahren","volume":"6","author":"Hierholzer","year":"1873","journal-title":"Math. Ann."},{"key":"10.1016\/j.dam.2026.02.004_b13","first-page":"33","article-title":"\u03a010 classes and degrees of theories","volume":"173","author":"Jockusch","year":"1972","journal-title":"Trans. Amer. Math. Soc."},{"key":"10.1016\/j.dam.2026.02.004_b14","series-title":"Logic and Computational Complexity","first-page":"367","article-title":"Automatic presentations of structures","volume":"vol. 960","author":"Khoussainov","year":"1995"},{"key":"10.1016\/j.dam.2026.02.004_b15","series-title":"Algebraic Foundations in Computer Science","first-page":"257","article-title":"Where automatic structures benefit from weighted automata","volume":"vol. 7020","author":"Kuske","year":"2011"},{"issue":"2","key":"10.1016\/j.dam.2026.02.004_b16","doi-asserted-by":"crossref","first-page":"678","DOI":"10.2178\/jsl\/1268917499","article-title":"Some natural decision problems in automatic graphs","volume":"75","author":"Kuske","year":"2010","journal-title":"J. Symb. Log."},{"issue":"4","key":"10.1016\/j.dam.2026.02.004_b17","doi-asserted-by":"crossref","first-page":"615","DOI":"10.1112\/plms\/s3-25.4.615","article-title":"Effective matchmaking (recursion theoretic aspects of a theorem of Philip Hall)","volume":"s3-25","author":"Manaster","year":"1972","journal-title":"Proc. Lond. Math. Soc."},{"issue":"3","key":"10.1016\/j.dam.2026.02.004_b18","doi-asserted-by":"crossref","first-page":"644","DOI":"10.2307\/1970028","article-title":"On degrees of unsolvability","volume":"69","author":"Shoenfield","year":"1959","journal-title":"Ann. Math."},{"key":"10.1016\/j.dam.2026.02.004_b19","series-title":"Turing Computability: Theory and Applications","author":"Soare","year":"2016"}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X26000697?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X26000697?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,4,29]],"date-time":"2026-04-29T21:08:39Z","timestamp":1777496919000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X26000697"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,6]]},"references-count":19,"alternative-id":["S0166218X26000697"],"URL":"https:\/\/doi.org\/10.1016\/j.dam.2026.02.004","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[2026,6]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Paths, ends and the separation problem for infinite graphs","name":"articletitle","label":"Article Title"},{"value":"Discrete Applied Mathematics","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.dam.2026.02.004","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2026 Elsevier B.V. All rights are reserved, including those for text and data mining, AI training, and similar technologies.","name":"copyright","label":"Copyright"}]}}