Paths, ends and the separation problem for infinite graphs

DOI10.1016/J.DAM.2026.02.004MaRDI QIDQ7230332zbMATH OpenFDO

Authors Nicanor Carrasco-Vargas, Valentino Delle Rose, Cristobal Rojas

Publication date 17 April 2026

Published in Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.DAM.2026.02.004

zbMATH Keywords

arithmetical hierarchyEulerian path problem for infinite graphshighly computable graphsinfinite pathsnumber of ends

Mathematics Subject Classification ID

Computability and recursion theory (03Dxx) Graph theory (05Cxx) Special aspects of infinite or finite groups (20Fxx)

Cites work

• Automatic presentations of structures
• Automatic structures: twenty years later
• Effective coloration
• Effective Matchmaking (Recursion Theoretic Aspects of a Theorem of Philip Hall)
• Geometric group theory. With an appendix by Bogdan Nica
• Graph-theoretical versus topological ends of graphs.
• scientific article; zbMATH DE number 3342830 (Why is no real title available?)
• On degrees of unsolvability
• Recursive Euler and Hamilton Paths
• Self-avoiding walks on Cayley graphs through the lens of symbolic dynamics
• Some natural decision problems in automatic graphs
• Turing computability. Theory and applications
• Where automatic structures benefit from weighted automata
• Über Euler-Linien unendlicher Graphen.
• ∏ 0 1 Classes and Degrees of Theories

This page was built for publication: Paths, ends and the separation problem for infinite graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7230332)