Perminov E A

Publications in Math-Net.Ru

1. The number of rigid graphs that are mutually nonimbeddable into one another
   
   Izv. Vyssh. Uchebn. Zaved. Mat., 1985, no. 8,  77–78