%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