Geodesic
Spanning trees of infinite graphs
Czechoslovak Mathematical Journal, Tome 41 (1991) no. 1, pp. 52-60
Cet article a éte moissonné depuis la source Czech Digital Mathematics Library

Voir la notice de l'article

DOI : 10.21136/CMJ.1991.102432
Classification : 05C05 
@article{10_21136_CMJ_1991_102432,
     author = {Polat, Norbert},
     title = {Spanning trees of infinite graphs},
     journal = {Czechoslovak Mathematical Journal},
     pages = {52--60},
     year = {1991},
     volume = {41},
     number = {1},
     doi = {10.21136/CMJ.1991.102432},
     mrnumber = {1087622},
     zbl = {0793.05054},
     language = {en},
     url = {http://geodesic.mathdoc.fr/articles/10.21136/CMJ.1991.102432/}
}
TY  - JOUR
AU  - Polat, Norbert
TI  - Spanning trees of infinite graphs
JO  - Czechoslovak Mathematical Journal
PY  - 1991
SP  - 52
EP  - 60
VL  - 41
IS  - 1
UR  - http://geodesic.mathdoc.fr/articles/10.21136/CMJ.1991.102432/
DO  - 10.21136/CMJ.1991.102432
LA  - en
ID  - 10_21136_CMJ_1991_102432
ER  - 
%0 Journal Article
%A Polat, Norbert
%T Spanning trees of infinite graphs
%J Czechoslovak Mathematical Journal
%D 1991
%P 52-60
%V 41
%N 1
%U http://geodesic.mathdoc.fr/articles/10.21136/CMJ.1991.102432/
%R 10.21136/CMJ.1991.102432
%G en
%F 10_21136_CMJ_1991_102432
Polat, Norbert. Spanning trees of infinite graphs. Czechoslovak Mathematical Journal, Tome 41 (1991) no. 1, pp. 52-60. doi: 10.21136/CMJ.1991.102432

[1] H. Freudenthal: Über die Enden diskreter Räume und Gruppen. Comment. Math. Helv. 17 (1944), 1 - 38. | DOI | MR

[2] R. Halin: Über unendliche Wege in Graphen. Math. Ann. 157 (1964), 125-137. | DOI | MR | Zbl

[3] R. Halin: Über die Maximalzahl fremder unendlicher Wege in Graphen. Math. Nachr. 30 (1965), 63-85. | DOI | MR | Zbl

[4] R. Halin: Die Maximalzahl fremder zweiseitig unendliche Wege in Graphen. Math. Nachr. 44 (1970), 119-127. | DOI | MR

[5] R. Halin: Simplicial decomposition of infinite graphs. Ann. Discrete Math. 3 (1978), 93-109. | DOI | MR

[6] N. Polat: Aspects topologiques de la séparation dans les graphes infinis. I. Math. Z 165 (1979), 73-100. | DOI | MR | Zbl

[7] N. Polat: Aspects topologiques de la séparation dans les graphes infinis. II. Math. Z 165 (1979), 171-191. | MR

[8] N. Polat: Développements terminaux des graphes infinis. I. Arbres maximaux coterminaux. Math. Nachr. 107 (1982), 283-314. | DOI | MR | Zbl

[9] N. Polat: Développements terminaux des graphes infinis. II. Degré de développement terminal, Math. Nachr. 110 (1983), 97-125. | DOI | MR | Zbl

[10] N. Polat: Développements terminaux des graphes infinis. III. Arbres maximaux sans rayon, cardinalité maximum des ensembles disjoint de rayons, Math. Nachr. 115 (1984), 337-352. | DOI | MR | Zbl

[11] N. Polat: Topological apsects of infinite graphs. in Cycles and Rays (G. Hahn et al., eds), NATO ASI Ser. C, Kluwer Academic Publishers, Dordrecht 1990, pp. 197-220. | MR

[12] P. Seymour, R. Thomas: As end-faithful spanning tree counterexample. Preprint. | MR

[13] B. Zelinka: Spanning Trees of Locally Finite Graphs. Czech. Math. J. 39 (1989), 193-197. | MR | Zbl

Cité par Sources :