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

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

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.

Henning Bruhn | H. Bruhn

[1] Frank Harary,et al. Graph Theory , 2016 .

[2] Elwood S. Buffa,et al. Graph Theory with Applications , 1977 .

[3] C. Paul Bonnington,et al. Graphs Embedded in the Plane with Finitely Many Accumulation Points , 2001 .

[4] Rudolf Halin,et al. Miscellaneous problems on infinite graphs , 2000, J. Graph Theory.

[5] Reinhard Diestel,et al. The Cycle Space of an Infinite Graph , 2005, Combinatorics, Probability and Computing.

[6] Reinhard Diestel,et al. On Infinite Cycles I , 2004, Comb..

[7] J. A. Bondy,et al. Graph Theory with Applications , 1978 .

[8] VERSION , 1922 .

[9] Reinhard Diestel,et al. On Infinite Cycles II , 2004, Comb..

[10] C. Paul Bonnington,et al. Graphs embedded in the plane with a bounded number of accumulation points , 2003 .

[11] Carsten Thomassen,et al. Planarity and duality of finite and infinite graphs , 1980, J. Comb. Theory B.

[12] Carsten Thomassen,et al. 3-connected planar spaces uniquely embed in the sphere , 2002 .

[13] Reinhard Diestel,et al. Topological paths, cycles and spanning trees in infinite graphs , 2004, Eur. J. Comb..