Geodesic
The number of rigid graphs that are mutually nonimbeddable into one another
Izvestiâ vysših učebnyh zavedenij. Matematika, no. 8 (1985), pp. 77-78.

Voir la notice de l'article provenant de la source Math-Net.Ru

@article{IVM_1985_8_a13,
     author = {E. A. Perminov},
     title = {The number of rigid graphs that are mutually nonimbeddable into one another},
     journal = {Izvesti\^a vys\v{s}ih u\v{c}ebnyh zavedenij. Matematika},
     pages = {77--78},
     publisher = {mathdoc},
     number = {8},
     year = {1985},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/IVM_1985_8_a13/}
}
TY  - JOUR
AU  - E. A. Perminov
TI  - The number of rigid graphs that are mutually nonimbeddable into one another
JO  - Izvestiâ vysših učebnyh zavedenij. Matematika
PY  - 1985
SP  - 77
EP  - 78
IS  - 8
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/IVM_1985_8_a13/
LA  - ru
ID  - IVM_1985_8_a13
ER  - 
%0 Journal Article
%A E. A. Perminov
%T The number of rigid graphs that are mutually nonimbeddable into one another
%J Izvestiâ vysših učebnyh zavedenij. Matematika
%D 1985
%P 77-78
%N 8
%I mathdoc
%U http://geodesic.mathdoc.fr/item/IVM_1985_8_a13/
%G ru
%F IVM_1985_8_a13
E. A. Perminov. The number of rigid graphs that are mutually nonimbeddable into one another. Izvestiâ vysših učebnyh zavedenij. Matematika, no. 8 (1985), pp. 77-78. http://geodesic.mathdoc.fr/item/IVM_1985_8_a13/