Geodesic
On the number of cycles in a random nonequiprobable graph
Diskretnaya Matematika, Tome 2 (1990) no. 3, pp. 137-145
Cet article a éte moissonné depuis la source Math-Net.Ru

Voir la notice de l'article

@article{DM_1990_2_3_a15,
     author = {V. F. Kolchin and V. I. Khokhlov},
     title = {On the number of cycles in a~random nonequiprobable graph},
     journal = {Diskretnaya Matematika},
     pages = {137--145},
     year = {1990},
     volume = {2},
     number = {3},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/DM_1990_2_3_a15/}
}
TY  - JOUR
AU  - V. F. Kolchin
AU  - V. I. Khokhlov
TI  - On the number of cycles in a random nonequiprobable graph
JO  - Diskretnaya Matematika
PY  - 1990
SP  - 137
EP  - 145
VL  - 2
IS  - 3
UR  - http://geodesic.mathdoc.fr/item/DM_1990_2_3_a15/
LA  - ru
ID  - DM_1990_2_3_a15
ER  - 
%0 Journal Article
%A V. F. Kolchin
%A V. I. Khokhlov
%T On the number of cycles in a random nonequiprobable graph
%J Diskretnaya Matematika
%D 1990
%P 137-145
%V 2
%N 3
%U http://geodesic.mathdoc.fr/item/DM_1990_2_3_a15/
%G ru
%F DM_1990_2_3_a15
V. F. Kolchin; V. I. Khokhlov. On the number of cycles in a random nonequiprobable graph. Diskretnaya Matematika, Tome 2 (1990) no. 3, pp. 137-145. http://geodesic.mathdoc.fr/item/DM_1990_2_3_a15/