The cycle space of a 3-connected locally finite graph is generated by its finite and infinite peripheral circuits

DOI10.1016/J.JCTB.2004.03.005zbMath1055.05088OpenAlexW2114991574MaRDI QIDQ705881

Henning Bruhn

Publication date: 16 February 2005

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jctb.2004.03.005

zbMATH Keywords

cycle spaceperipheral circuits

Mathematics Subject Classification ID

Trees (05C05) Paths and cycles (05C38)

Related Items (18)

Peripheral circuits in infinite binary matroids ⋮ On the hamiltonicity of line graphs of locally finite, 6-edge-connected graphs ⋮ Graph-like continua, augmenting arcs, and Menger's theorem ⋮ On spanning tree packings of highly edge connected graphs ⋮ The fundamental group of a locally finite graph with ends ⋮ The homology of a locally finite graph with ends ⋮ Eulerian edge sets in locally finite graphs ⋮ Connected but not path-connected subspaces of infinite graphs ⋮ Embedding a graph-like continuum in a surface ⋮ Bases and closures under infinite sums ⋮ MacLane's planarity criterion for locally finite graphs ⋮ On the homology of locally compact spaces with ends ⋮ Locally finite graphs with ends: A topological approach. II: Applications ⋮ Graph-like spaces: an introduction ⋮ Locally finite graphs with ends: A topological approach. I: Basic theory ⋮ Graph topologies induced by edge lengths ⋮ Cycle spaces in topological spaces ⋮ Infinite Hamilton cycles in squares of locally finite graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On infinite cycles. I, II
• Planarity and duality of finite and infinite graphs
• Topological paths, cycles and spanning trees in infinite graphs
• 3-connected planar spaces uniquely embed in the sphere
• Graphs embedded in the plane with a bounded number of accumulation points
• The Cycle Space of an Infinite Graph
• How to Draw a Graph

This page was built for publication: The cycle space of a 3-connected locally finite graph is generated by its finite and infinite peripheral circuits