On the complexity of recognizing Hamming graphs and related classes of graphs
Publikationen: Beitrag in Fachzeitschrift › Artikel › Forschung › (peer-reviewed)
Standard
in: European journal of combinatorics , Jahrgang 17, Nr. 2-3, 02.1996, S. 209-221.
Publikationen: Beitrag in Fachzeitschrift › Artikel › Forschung › (peer-reviewed)
Harvard
APA
Vancouver
Author
Bibtex - Download
}
RIS (suitable for import to EndNote) - Download
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
VL - 17
SP - 209
EP - 221
JO - European journal of combinatorics
JF - European journal of combinatorics
SN - 0195-6698
IS - 2-3
ER -