On the complexity of recognizing Hamming graphs and related classes of graphs
From MaRDI portal
Publication:1911841
DOI10.1006/eujc.1996.0018zbMath0846.05082OpenAlexW2043736547MaRDI QIDQ1911841
Wilfried Imrich, Sandi Klavžar
Publication date: 3 July 1996
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/eujc.1996.0018
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Planar graphs; geometric and topological aspects of graph theory (05C10) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (14)
Recognizing Hamming graphs in linear time and space ⋮ Clique-gated graphs ⋮ Wiener number of vertex-weighted graphs and a chemical application ⋮ The majority strategy on graphs ⋮ Factorization and pseudofactorization of weighted graphs ⋮ Cubic inflation, mirror graphs, regular maps, and partial cubes ⋮ About some robustness and complexity properties of \(G\)-graphs networks ⋮ The lattice dimension of a graph ⋮ Unnamed Item ⋮ Graphs over graded rings and relation with Hamming graph ⋮ Recognizing median graphs in subquadratic time ⋮ Factoring cardinal product graphs in polynomial time ⋮ Distances in benzenoid systems: Further developments ⋮ On the canonical metric representation, average distance, and partial Hamming graphs
This page was built for publication: On the complexity of recognizing Hamming graphs and related classes of graphs
