"On the Complexity of Recognizing Hamming Graphs and Related Classes of Graphs."

Wilfried Imrich, Sandi Klavzar (1996)

> Home

Details and statistics

DOI: 10.1006/EUJC.1996.0018

access: open

type: Journal Article

metadata version: 2023-06-26

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - journals/ejc/ImrichK96
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/ejc/ImrichK96
Wilfried Imrich, Sandi Klavzar:
On the Complexity of Recognizing Hamming Graphs and Related Classes of Graphs. Eur. J. Comb. 17(2-3): 209-221 (1996)

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.