On the complexity of recognizing Hamming graphs and related classes of graphs

Wilfried Imrich, Sandi Klavžar

Research output: Contribution to journal › Article › Research › peer-review

27 Citations (Scopus)

Original language	English
Pages (from-to)	209-221
Number of pages	13
Journal	European journal of combinatorics
Volume	17
Issue number	2-3
DOIs	https://doi.org/10.1006/eujc.1996.0018
Publication status	Published - Feb 1996

Access to Document

@article{03d67765e312479b837d77bb4e3376f9,

title = "On the complexity of recognizing Hamming graphs and related classes of graphs",

author = "Wilfried Imrich and Sandi Klav{\v z}ar",

year = "1996",

month = feb,

doi = "10.1006/eujc.1996.0018",

language = "English",

volume = "17",

pages = "209--221",

journal = "European journal of combinatorics ",

issn = "0195-6698",

publisher = "Academic Press",

number = "2-3",

}

TY - JOUR

T1 - On the complexity of recognizing Hamming graphs and related classes of graphs

AU - Imrich, Wilfried

AU - Klavžar, Sandi

PY - 1996/2

Y1 - 1996/2

UR - http://www.scopus.com/inward/record.url?scp=0040748193&partnerID=8YFLogxK

U2 - 10.1006/eujc.1996.0018

DO - 10.1006/eujc.1996.0018

M3 - Article

AN - SCOPUS:0040748193

SN - 0195-6698

VL - 17

SP - 209

EP - 221

JO - European journal of combinatorics

JF - European journal of combinatorics

IS - 2-3

ER -