Geodesic
Matroid and Tutte-connectivity in infinite graphs
Henning Bruhn1
1Universität Ulm
The electronic journal of combinatorics, Tome 21 (2014) no. 2
Cet article a éte moissonné depuis la source The Electronic Journal of Combinatorics website

Voir la notice de l'article

We relate matroid connectivity to Tutte-connectivity in an infinite graph. Moreover, we show that the two cycle matroids, the finite-cycle matroid and the cycle matroid, in which also infinite cycles are taken into account, have the same connectivity function. As an application we re-prove that, also for infinite graphs, Tutte-connectivity is invariant under taking dual graphs.
DOI : 10.37236/2832
Classification : 05C63, 05C40, 05B35
Mots-clés : connectivity, infinite graphs, infinite matroids

Henning Bruhn  1

1 Universität Ulm 
@article{10_37236_2832,
     author = {Henning Bruhn},
     title = {Matroid and {Tutte-connectivity} in infinite graphs},
     journal = {The electronic journal of combinatorics},
     year = {2014},
     volume = {21},
     number = {2},
     doi = {10.37236/2832},
     zbl = {1300.05192},
     url = {http://geodesic.mathdoc.fr/articles/10.37236/2832/}
}
TY  - JOUR
AU  - Henning Bruhn
TI  - Matroid and Tutte-connectivity in infinite graphs
JO  - The electronic journal of combinatorics
PY  - 2014
VL  - 21
IS  - 2
UR  - http://geodesic.mathdoc.fr/articles/10.37236/2832/
DO  - 10.37236/2832
ID  - 10_37236_2832
ER  - 
%0 Journal Article
%A Henning Bruhn
%T Matroid and Tutte-connectivity in infinite graphs
%J The electronic journal of combinatorics
%D 2014
%V 21
%N 2
%U http://geodesic.mathdoc.fr/articles/10.37236/2832/
%R 10.37236/2832
%F 10_37236_2832
Henning Bruhn. Matroid and Tutte-connectivity in infinite graphs. The electronic journal of combinatorics, Tome 21 (2014) no. 2. doi: 10.37236/2832

Cité par Sources :