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

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. [doi]

@article{ImrichK96,
  title = {On the Complexity of Recognizing Hamming Graphs and Related Classes of Graphs},
  author = {Wilfried Imrich and Sandi Klavzar},
  year = {1996},
  doi = {10.1006/eujc.1996.0018},
  url = {http://dx.doi.org/10.1006/eujc.1996.0018},
  tags = {graph-rewriting, rewriting},
  researchr = {https://researchr.org/publication/ImrichK96},
  cites = {0},
  citedby = {0},
  journal = {Eur. J. Comb.},
  volume = {17},
  number = {2-3},
  pages = {209-221},
}