Stop the war!
Остановите войну!
for scientists:
default search action
"The Johnson graph J(d, r) is unique if (d, r) != (2, 8)."
Paul M. Terwilliger (1986)
- Paul M. Terwilliger:
The Johnson graph J(d, r) is unique if (d, r) != (2, 8). Discret. Math. 58(2): 175-189 (1986)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.