Geodesic
Finding a spanning tree of a graph with maximal number of terminal vertices
Kybernetika, Tome 09 (1973) no. 5, p. 360.

Voir la notice de l'article provenant de la source Czech Digital Mathematics Library

Classification : 05-04, 05C05, 05Cxx 
@article{KYB_1973__9_5_a1,
     author = {Zelinka, Bohdan},
     title = {Finding a spanning tree of a graph with maximal number of terminal vertices},
     journal = {Kybernetika},
     pages = {--360},
     publisher = {mathdoc},
     volume = {09},
     number = {5},
     year = {1973},
     mrnumber = {0323598},
     zbl = {0265.05101},
     language = {en},
     url = {http://geodesic.mathdoc.fr/item/KYB_1973__9_5_a1/}
}
TY  - JOUR
AU  - Zelinka, Bohdan
TI  - Finding a spanning tree of a graph with maximal number of terminal vertices
JO  - Kybernetika
PY  - 1973
SP  - 
EP  - 360
VL  - 09
IS  - 5
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/KYB_1973__9_5_a1/
LA  - en
ID  - KYB_1973__9_5_a1
ER  - 
%0 Journal Article
%A Zelinka, Bohdan
%T Finding a spanning tree of a graph with maximal number of terminal vertices
%J Kybernetika
%D 1973
%P -360
%V 09
%N 5
%I mathdoc
%U http://geodesic.mathdoc.fr/item/KYB_1973__9_5_a1/
%G en
%F KYB_1973__9_5_a1
Zelinka, Bohdan. Finding a spanning tree of a graph with maximal number of terminal vertices. Kybernetika, Tome 09 (1973) no. 5, p. 360. http://geodesic.mathdoc.fr/item/KYB_1973__9_5_a1/