RUS  ENG
Full version
JOURNALS // Izvestiya Vysshikh Uchebnykh Zavedenii. Matematika // Archive

Izv. Vyssh. Uchebn. Zaved. Mat., 1985 Number 8, Pages 77–78 (Mi ivm7402)

Brief communications

The number of rigid graphs that are mutually nonimbeddable into one another

E. A. Perminov


UDC: 512.534

MSC: Primary 05C20; Secondary 05C10, 18C10

Received: 20.12.1984


 English version:
Soviet Mathematics (Izvestiya VUZ. Matematika), 1985, 29:8, 107–111

Bibliographic databases:


© Steklov Math. Inst. of RAS, 2024