Eulerian edge sets in locally finite graphs

DOI10.1007/s00493-011-2572-0zbMath1274.05251OpenAlexW2015187259MaRDI QIDQ653982

Eli Berger, Henning Bruhn

Publication date: 20 December 2011

Published in: Combinatorica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00493-011-2572-0

zbMATH Keywords

Eulerian edge sets

Mathematics Subject Classification ID

Paths and cycles (05C38) Eulerian and Hamiltonian graphs (05C45)

Related Items

Extending cycles locally to Hamilton cycles ⋮ Eulerian Spaces ⋮ A sufficient condition for Hamiltonicity in locally finite graphs ⋮ Algebraic flow theory of infinite graphs ⋮ On the homology of locally compact spaces with ends ⋮ Locally finite graphs with ends: A topological approach. I: Basic theory

Cites Work

• Unnamed Item
• On infinite cycles. I, II
• The cycle space of a 3-connected locally finite graph is generated by its finite and infinite peripheral circuits
• Topological paths, cycles and spanning trees in infinite graphs
• Graph-like continua, augmenting arcs, and Menger's theorem
• On end degrees and infinite cycles in locally finite graphs
• MacLane's planarity criterion for locally finite graphs
• Hamilton circles in infinite planar graphs
• Infinite Hamilton cycles in squares of locally finite graphs
• Cycle spaces in topological spaces
• Cycle‐cocycle partitions and faithful cycle covers for locally finite graphs