The Lovász-Cherkassky theorem for locally finite graphs with ends
From MaRDI portal
Publication:6080535
DOI10.1016/j.disc.2023.113586zbMath1522.05209arXiv2109.11260WikidataQ123018839 ScholiaQ123018839MaRDI QIDQ6080535
Raphael W. Jacobs, Jan Kurkofka, Ruben Melcher, Paul Knappe, Attila Joó
Publication date: 4 October 2023
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2109.11260
Extremal problems in graph theory (05C35) Deterministic network models in operations research (90B10) Enumeration in graph theory (05C30) Paths and cycles (05C38) Relations of low-dimensional topology with graph theory (57M15) Connectivity (05C40)
Cites Work
- Unnamed Item
- On infinite cycles. I, II
- Locally finite graphs with ends: a topological approach. III. Fundamental group and homology
- Locally finite graphs with ends: A topological approach. II: Applications
- Menger's theorem for infinite graphs
- The countable Erdős-Menger conjecture with ends
- Topological paths, cycles and spanning trees in infinite graphs
- Locally finite graphs with ends: A topological approach. I: Basic theory
- On end degrees and infinite cycles in locally finite graphs
- The Lovász-Cherkassky theorem in countable graphs
- Graph Theory
- On some connectivity properties of Eulerian graphs
- Menger's theorem for infinite graphs with ends
This page was built for publication: The Lovász-Cherkassky theorem for locally finite graphs with ends