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

Authors:
Henning Bruhn
Affiliations:
AG Geometrie und Diskrete Mathematik, Mathematisches Seminar, Universität Hamburg, Fachbereich Mathematik, Bundesstraße 55, Raum 229, DE-20146 Hamburg, Germany
Venue:
Journal of Combinatorial Theory Series B - Special issue dedicated to professor W. T. Tutte
Year:
2004

Citing 7
Cited 3

On Infinite Cycles I

Combinatorica
On Infinite Cycles II

Combinatorica
Topological paths, cycles and spanning trees in infinite graphs

European Journal of Combinatorics - Special issue: Topological graph theory
The Cycle Space of an Infinite Graph

Combinatorics, Probability and Computing
Graph Theory With Applications

Graph Theory With Applications
Miscellaneous problems on infinite graphs

Journal of Graph Theory
Graphs embedded in the plane with a bounded number of accumulation points

Journal of Graph Theory

The Cycle Space of an Infinite Graph

Combinatorics, Probability and Computing
MacLane's planarity criterion for locally finite graphs

Journal of Combinatorial Theory Series B
On the hamiltonicity of line graphs of locally finite, 6-edge-connected graphs

Journal of Graph Theory

Quantified Score

Hi-index	0.00

Visualization

Abstract

We extend Tutte's result that in a finite 3-connected graph the cycle space is generated by the peripheral circuits to locally finite graphs. Such a generalization becomes possible by the admission of infinite circuits in the graph compactified by its ends.