Geodesic
End-faithful spanning trees of countable graphs with prescribed sets of rays
Czechoslovak Mathematical Journal, Tome 51 (2001) no. 1, pp. 45-53 Cet article a éte moissonné depuis la source Czech Digital Mathematics Library

Voir la notice de l'article

We prove that a countable connected graph has an end-faithful spanning tree that contains a prescribed set of rays whenever this set is countable, and we show that this solution is, in a certain sense, the best possible. This improves a result of Hahn and Širáň Theorem 1.
We prove that a countable connected graph has an end-faithful spanning tree that contains a prescribed set of rays whenever this set is countable, and we show that this solution is, in a certain sense, the best possible. This improves a result of Hahn and Širáň Theorem 1.
Classification : 05C05, 05C25, 05C38, 05C99 
@article{CMJ_2001_51_1_a4,
     author = {Polat, Norbert},
     title = {End-faithful spanning trees of countable graphs with prescribed sets of rays},
     journal = {Czechoslovak Mathematical Journal},
     pages = {45--53},
     year = {2001},
     volume = {51},
     number = {1},
     mrnumber = {1814631},
     zbl = {1079.05508},
     language = {en},
     url = {http://geodesic.mathdoc.fr/item/CMJ_2001_51_1_a4/}
}
TY  - JOUR
AU  - Polat, Norbert
TI  - End-faithful spanning trees of countable graphs with prescribed sets of rays
JO  - Czechoslovak Mathematical Journal
PY  - 2001
SP  - 45
EP  - 53
VL  - 51
IS  - 1
UR  - http://geodesic.mathdoc.fr/item/CMJ_2001_51_1_a4/
LA  - en
ID  - CMJ_2001_51_1_a4
ER  - 
%0 Journal Article
%A Polat, Norbert
%T End-faithful spanning trees of countable graphs with prescribed sets of rays
%J Czechoslovak Mathematical Journal
%D 2001
%P 45-53
%V 51
%N 1
%U http://geodesic.mathdoc.fr/item/CMJ_2001_51_1_a4/
%G en
%F CMJ_2001_51_1_a4
Polat, Norbert. End-faithful spanning trees of countable graphs with prescribed sets of rays. Czechoslovak Mathematical Journal, Tome 51 (2001) no. 1, pp. 45-53. http://geodesic.mathdoc.fr/item/CMJ_2001_51_1_a4/