Geodesic
\(T\)-joins in infinite graphs
Attila Joó1
1Eötvös Loránd University
The electronic journal of combinatorics, Tome 24 (2017) no. 3
Cet article a éte moissonné depuis la source The Electronic Journal of Combinatorics website

Voir la notice de l'article

We characterize the class of infinite graphs $G$ for which there exists a $T$-join for any choice of an infinite $T \subseteq V(G)$. We also show that the following well-known fact remains true in the infinite case. If $G$ is connected and does not contain a $T$-join, then it will if we either remove an arbitrary vertex from $T$ or add any new vertex to $T$.
DOI : 10.37236/6308
Classification : 05C63, 05C38, 05C40, 05C70
Mots-clés : infinite graph, \(T\)-join

Attila Joó  1

1 Eötvös Loránd University 
@article{10_37236_6308,
     author = {Attila Jo\'o},
     title = {\(T\)-joins in infinite graphs},
     journal = {The electronic journal of combinatorics},
     year = {2017},
     volume = {24},
     number = {3},
     doi = {10.37236/6308},
     zbl = {1367.05146},
     url = {http://geodesic.mathdoc.fr/articles/10.37236/6308/}
}
TY  - JOUR
AU  - Attila Joó
TI  - \(T\)-joins in infinite graphs
JO  - The electronic journal of combinatorics
PY  - 2017
VL  - 24
IS  - 3
UR  - http://geodesic.mathdoc.fr/articles/10.37236/6308/
DO  - 10.37236/6308
ID  - 10_37236_6308
ER  - 
%0 Journal Article
%A Attila Joó
%T \(T\)-joins in infinite graphs
%J The electronic journal of combinatorics
%D 2017
%V 24
%N 3
%U http://geodesic.mathdoc.fr/articles/10.37236/6308/
%R 10.37236/6308
%F 10_37236_6308
Attila Joó. \(T\)-joins in infinite graphs. The electronic journal of combinatorics, Tome 24 (2017) no. 3. doi: 10.37236/6308

Cité par Sources :