The cycle space of a 3-connected locally finite graph is generated by its finite and infinite peripheral circuits-Reference-Cited by-同舟云学术

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

Published:2004-11 Issue:2 Volume:92 Page:235-256
ISSN:0095-8956
Container-title:Journal of Combinatorial Theory, Series B
language:en
Short-container-title:Journal of Combinatorial Theory, Series B

Author:

Bruhn Henning

Publisher

Elsevier BV

Subject

Computational Theory and Mathematics,Discrete Mathematics and Combinatorics,Theoretical Computer Science

Reference12 articles.

1. J.A. Bondy, U.S.R. Murty, Graph Theory with Applications, Macmillan Press, London 1976.

2. Graphs embedded in the plane with finitely many accumulation points;Bonnington;J. Graph. Theory,2003

3. R. Diestel, The cycle space of an infinite graph, Comb., Probab. Comput., to appear.

4. R. Diestel, Graph Theory, 2nd Edition, Springer, Berlin, 2000, Electronic edition available at: http://www.math.uni-hamburg.de/home/diestel/books/graph.theory/download.html

5. On infinite cycles I;Diestel;Combinatorica,2004

Cited by 19 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Peripheral circuits in infinite binary matroids;Journal of Combinatorial Theory, Series B;2019-01

2. Embedding a graph-like continuum in a surface;Combinatorica;2014-09-29

3. On spanning tree packings of highly edge connected graphs;Journal of Combinatorial Theory, Series B;2014-03

4. On the hamiltonicity of line graphs of locally finite, 6-edge-connected graphs;Journal of Graph Theory;2011-11-22

5. Bases and closures under infinite sums;Linear Algebra and its Applications;2011-10