
Strong isometric dimension, biclique coverings, and Sperner's TheoremNice constructive proof using Sperner's Theorem. AbstractThe strong isometric dimension of a graph G is the least number k such that G isometrically embeds into the strong product of k paths. Using Sperner's Theorem, the strong isometric dimension of the Hamming graphs K_{2} × K_{n} is determined. Status
Published.
