On the complexity of recognizing Hamming graphs and related classes of graphs
European Journal of Combinatorics - Special issue on discrete metric spaces
Center and diameter problems in plane triangulations and quadrangulations
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Discrete Applied Mathematics
Partial cubes and their τ-graphs
European Journal of Combinatorics
Recognizing partial cubes in quadratic time
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Discrete Applied Mathematics
European Journal of Combinatorics
Graph Drawing
European Journal of Combinatorics
European Journal of Combinatorics
Upright-quad drawing of st-planar learning spaces
GD'06 Proceedings of the 14th international conference on Graph drawing
Steinitz theorems for orthogonal polyhedra
Proceedings of the twenty-sixth annual symposium on Computational geometry
Weak sense of direction labelings and graph embeddings
Discrete Applied Mathematics
Combinatorics and Geometry of Finite and Infinite Squaregraphs
SIAM Journal on Discrete Mathematics
GD'04 Proceedings of the 12th international conference on Graph Drawing
Convex Excess in Partial Cubes
Journal of Graph Theory
Shortest path problem in rectangular complexes of global nonpositive curvature
Computational Geometry: Theory and Applications
Hamming dimension of a graph-The case of Sierpiński graphs
European Journal of Combinatorics
Hi-index | 0.00 |
We describe a polynomial time algorithm for, given an undirected graph G, finding the minimum dimension d such that G may be isometrically embedded into the d-dimensional integer lattice Zd.