Paths, ends and the separation problem for infinite graphs
Authors:
- Nicanor Carrasco-VargasNCNicanor Carrasco-Vargas
- Valentino Delle RoseVRValentino Delle Rose
- Cristóbal RojasCRCristóbal Rojas
- 10 February 2026
- journal article
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 386, 139-155
Abstract
No abstract availableAll Related Versions
Funding Information
- Fondo Nacional de Desarrollo Científico y Tecnológico (Chile1230469)
- Fondo Nacional de Desarrollo Científico y Tecnológico (1230469)
- Uniwersytet Jagielloński Collegium Medicum (2022BXH4R5)
- Ministero dell'Istruzione e del Merito
- Uniwersytet Jagielloński w Krakowie
- Agencia Nacional de Investigación y Desarrollo
- Ministero dell'Università e della Ricerca
- Ministero dell’Istruzione, dell’Università e della Ricerca
This publication has 12 references indexed in Scilit:
- Infinite Eulerian paths are computable on graphs with vertices of infinite degreeComputability, 2025
- Some natural decision problems in automatic graphsThe Journal of Symbolic Logic, 2010
- Graph-theoretical versus topological ends of graphsJournal of Combinatorial Theory, Series B, 2003
- Effective colorationThe Journal of Symbolic Logic, 1976
- Recursive Euler and Hamilton pathsProceedings of the American Mathematical Society, 1976
- Effective Matchmaking (Recursion Theoretic Aspects of a Theorem of Philip Hall)Proceedings of the London Mathematical Society, 1972
- A hierarchy of sets. IAlgebra and Logic, 1968
- On Degrees of UnsolvabilityAnnals of Mathematics, 1959
- ÜBER Euler‐Linien Unendlicher GraphenJournal of Mathematics and Physics, 1938
- Ueber die Möglichkeit, einen Linienzug ohne Wiederholung und ohne Unterbrechung zu umfahrenMathematische Annalen, 1873