TY  - JOUR
AU  - V. A. Voblyi
TI  - A simple upper bound for the number of spanning trees of regular graphs
JO  - Diskretnaya Matematika
PY  - 2008
SP  - 47
EP  - 50
VL  - 20
IS  - 3
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/DM_2008_20_3_a4/
LA  - ru
ID  - DM_2008_20_3_a4
ER  -