{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,30]],"date-time":"2026-04-30T02:53:30Z","timestamp":1777517610650,"version":"3.51.4"},"reference-count":24,"publisher":"SAGE Publications","issue":"2","license":[{"start":{"date-parts":[[2025,5,1]],"date-time":"2025-05-01T00:00:00Z","timestamp":1746057600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/journals.sagepub.com\/page\/policies\/text-and-data-mining-license"}],"funder":[{"DOI":"10.13039\/501100020884","name":"ANID","doi-asserted-by":"crossref","award":["2020-21201185"],"award-info":[{"award-number":["2020-21201185"]}],"id":[{"id":"10.13039\/501100020884","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["journals.sagepub.com"],"crossmark-restriction":true},"short-container-title":["Computability"],"published-print":{"date-parts":[[2025,5]]},"abstract":"<jats:p>The Erd\u0151s, Gr\u00fcnwald, and Weiszfeld theorem is a characterization of those infinite graphs which are Eulerian. That is, infinite graphs that admit infinite Eulerian paths. In this article, we prove an effective version of the Erd\u0151s, Gr\u00fcnwald, and Weiszfeld theorem for a class of graphs where vertices of infinite degree are allowed, generalizing a theorem of D. Bean. Our results are obtained from a characterization of those finite paths in a graph that can be extended to infinite Eulerian paths.<\/jats:p>","DOI":"10.1177\/22113568251359095","type":"journal-article","created":{"date-parts":[[2025,12,10]],"date-time":"2025-12-10T10:47:59Z","timestamp":1765363679000},"page":"95-110","update-policy":"https:\/\/doi.org\/10.1177\/sage-journals-update-policy","source":"Crossref","is-referenced-by-count":1,"title":["Infinite Eulerian paths are computable on graphs with vertices of infinite degree"],"prefix":"10.1177","volume":"14","author":[{"ORCID":"https:\/\/orcid.org\/0009-0002-7381-4382","authenticated-orcid":false,"given":"Nicanor","family":"Carrasco-Vargas","sequence":"first","affiliation":[{"name":"Facultad de Matem\u00e1ticas, Pontificia Universidad Cat\u00f3lica de Chile, Chile Current affiliation: Jagiellonian University, Krak\u00f3w, Poland."}]}],"member":"179","published-online":{"date-parts":[[2025,12,10]]},"reference":[{"key":"e_1_3_3_2_2","unstructured":"Fleischner H. Eulerian graphs and related topics Annals of Discrete Mathematics Vol. 45 Amsterdam New York Oxford Tokyo: North-Holland 1990. ISBN 978-0-444-88395-7 978-0-444-89110-5."},{"key":"e_1_3_3_3_2","first-page":"129","article-title":"On Eulerian lines in infinite graphs","volume":"43","author":"Erd\u0151s P","year":"1936","unstructured":"Erd\u0151s P, Gr\u00fcnwald T, Weiszfeld E. On Eulerian lines in infinite graphs. Mat Fiz Lapok 1936; 43: 129\u2013140.","journal-title":"Mat Fiz Lapok"},{"key":"e_1_3_3_4_2","doi-asserted-by":"publisher","DOI":"10.2307\/2272247"},{"key":"e_1_3_3_5_2","doi-asserted-by":"publisher","DOI":"10.4153\/CJM-1982-075-6"},{"key":"e_1_3_3_6_2","doi-asserted-by":"publisher","DOI":"10.4153\/CJM-1980-062-7"},{"key":"e_1_3_3_7_2","doi-asserted-by":"publisher","DOI":"10.1016\/0095-8956(84)90041-8"},{"key":"e_1_3_3_8_2","doi-asserted-by":"publisher","DOI":"10.1016\/0168-0072(83)90052-0"},{"key":"e_1_3_3_9_2","doi-asserted-by":"publisher","DOI":"10.1112\/plms\/s3-25.4.615"},{"key":"e_1_3_3_10_2","doi-asserted-by":"publisher","unstructured":"Specker E. Ramsey\u2019s theorem does not hold in recursive set theory. In: Gandy RO and Yates CME (eds) Studies in logic and the foundations of mathematics. LOGIC COLLOQUIUM \u201969 Vol. 61 1971 pp.439\u2013442. Elsevier. DOI: 10.1016\/S0049-237X(08)71242-4.","DOI":"10.1016\/S0049-237X(08)71242-4"},{"key":"e_1_3_3_11_2","doi-asserted-by":"publisher","DOI":"10.2307\/2272972"},{"key":"e_1_3_3_12_2","doi-asserted-by":"publisher","DOI":"10.1016\/0168-0072(86)90051-5"},{"key":"e_1_3_3_13_2","doi-asserted-by":"publisher","DOI":"10.1007\/s00153-013-0359-2"},{"key":"e_1_3_3_14_2","doi-asserted-by":"publisher","DOI":"10.2178\/jsl\/1268917499"},{"key":"e_1_3_3_15_2","unstructured":"Kuske D Lohrey M. Euler paths and ends in automatic and recursive graphs. In: Csuhaj-Varj\u00fa E and \u00c9sik Z (eds) Automata and formal languages 12th international conference AFL 2008 Balatonf\u00fcred Hungary May 27\u201330 2008 proceedings 2008 pp.245\u2013256."},{"key":"e_1_3_3_16_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.apal.2015.11.003"},{"key":"e_1_3_3_17_2","doi-asserted-by":"publisher","DOI":"10.1007\/BF02568567"},{"key":"e_1_3_3_18_2","doi-asserted-by":"publisher","DOI":"10.1007\/BF02566233"},{"key":"e_1_3_3_19_2","doi-asserted-by":"publisher","DOI":"10.1007\/BF01362670"},{"key":"e_1_3_3_20_2","doi-asserted-by":"publisher","DOI":"10.1016\/S0095-8956(02)00034-5"},{"key":"e_1_3_3_21_2","doi-asserted-by":"publisher","DOI":"10.1007\/s00224-016-9737-6"},{"key":"e_1_3_3_22_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-53622-3"},{"key":"e_1_3_3_23_2","doi-asserted-by":"crossref","unstructured":"Bollob\u00e1s B. Modern graph theory. Graduate texts in mathematics Vol. 184 Springer New York New York NY 1998. ISBN 978-0-387-98488-9 978-1-4612-0619-4. DOI: 10.1007\/978-1-4612-0619-4.","DOI":"10.1007\/978-1-4612-0619-4"},{"key":"e_1_3_3_24_2","unstructured":"Calvert W Miller R Reimann JC. The distance function on a computable graph arXiv:1111.2480 [cs math] (2011)."},{"key":"e_1_3_3_25_2","unstructured":"Carrasco-Vargas N. The geometric subgroup membership problem arXiv 2023. 10.48550\/arXiv.2303.14820."}],"container-title":["Computability"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.1177\/22113568251359095","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/journals.sagepub.com\/doi\/full-xml\/10.1177\/22113568251359095","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.1177\/22113568251359095","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,28]],"date-time":"2026-04-28T16:03:05Z","timestamp":1777392185000},"score":1,"resource":{"primary":{"URL":"https:\/\/journals.sagepub.com\/doi\/10.1177\/22113568251359095"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,5]]},"references-count":24,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2025,5]]}},"alternative-id":["10.1177\/22113568251359095"],"URL":"https:\/\/doi.org\/10.1177\/22113568251359095","relation":{},"ISSN":["2211-3568","2211-3576"],"issn-type":[{"value":"2211-3568","type":"print"},{"value":"2211-3576","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,5]]}}}