TY  - JOUR
AU  - Zelinka, Bohdan
TI  - Finding a spanning tree of a graph with maximal number of terminal vertices
JO  - Kybernetika
PY  - 1973
SP  - 357
EP  - 360
VL  - 9
IS  - 5
UR  - http://geodesic.mathdoc.fr/item/KYB_1973_9_5_a1/
LA  - en
ID  - KYB_1973_9_5_a1
ER  -