Stop the war!

Остановите войну!

for scientists:

default search action

combined dblp search
author search
venue search
publication search

ask others

"The Johnson graph J(d, r) is unique if (d, r) != (2, 8)."

Paul M. Terwilliger (1986)

> Home

Details and statistics

DOI: 10.1016/0012-365X(86)90160-3

access: open

type: Journal Article

metadata version: 2021-02-12

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - journals/dm/Terwilliger86
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/dm/Terwilliger86
Paul M. Terwilliger:
The Johnson graph J(d, r) is unique if (d, r) != (2, 8). Discret. Math. 58(2): 175-189 (1986)

a service of

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.