On the complexity of recognizing Hamming graphs and related classes of graphs

European Journal of Combinatorics

Volumn 17, Issue 2-3, 1996, Pages 209-221

  Imrich, Wilfried ^a   Klavžar, Sandi ^b  

^a UNIVERSITY OF LEOBEN   (Austria)

^b UNIVERSITY OF MARIBOR   (Slovenia)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0040748193     PISSN: 01956698     EISSN: None     Source Type: Journal    
DOI: 10.1006/eujc.1996.0018     Document Type: Article

References (35)

1. 2 log n) time, in: Proceedings of the 16th International Workshop on Graph Theoretical Concepts in Computer Science, Lecture Notes in Computer Science 484, Springer-Verlag, New York, 1991, pp. 90-98. Also: Math. Systems Theory, 28 (1995), 387-396.
2. 2 log n) time, in: Proceedings of the 16th International Workshop on Graph Theoretical Concepts in Computer Science, Lecture Notes in Computer Science 484, Springer-Verlag, New York, 1991, pp. 90-98. Also: Math. Systems Theory, 28 (1995), 387-396.
3. F. Aurenhammer and J. Hagauer, Computing equivalence classes among the edges of a graph with applications, Discr. Math., 109 (1992), 3-12.
4. F. Aurenhammer, J. Hagaurer and W. Imrich, Cartesian graph factorization at logarithmic cost per edge, Comput. Complexity, 2 (1992), 331-349.
5. F. Aurenhammer, M. Formann, R. Idury, A. Schäffer and F. Wagner, Faster isometric embeddings in products of complete graphs, Discr. Appl. Math. 52 (1994), 17-28.
6. 1 hierarchy, Discr. Math., 131 (1994), 17-28.
7. H.-J. Bandelt, Retracts of hypercubes, J. Graph Theory, 8 (1984), 501-510.
8. H.-J. Bandelt, Characterization of Hamming graphs, manuscript, August 1992.
9. H. J. Bandelt and H. M. Mulder, in E. Wilkeit, Quasi-median graphs and algebras, J. Graph Theory, 18 (1994), 681-703.
10. K. V. S. Bhat, On the complexity of testing a graph for n-cube, Inform. Process. Lett., 11 (1980), 16-19.
11. V. D. Chepoi, d-convexity and isometric subgraphs of Hamming graphs, Cybernetics, 1 (1988), 6-9.
12. F. R. K. Chung, R. L. Graham and M. E. Saks, Dynamic search in graphs, in: Discrete Algorithms and Complexity, H. Wilf (ed.), Academic Press, New York, 1987, pp. 351-387.
13. F. R. K. Chung, R. L. Graham and M. E. Saks, A dynamic location problem for graphs, Combinatorica, 9 (1989), 111-132.
14. M. Deza and V. P. Grishukhin, Hypermetric graphs, Q. J. Math. Oxford, Ser. (2), 44 (1993), 399-433.
15. 1-rigid graphs, J. Alg. Combin., 3 (1994), 153-175.
16. 1-graphs with complexity O(nm), or football in a hypercube, Rapport de Recherche du LIENS, May 1995.
17. D. Djoković, Distance preserving subgraphs of hypercubes, J. Combin. Theory, Ser. B, 14 (1973), 263-267.
18. T. Feder, Product graph representations, J. Graph Theory, 16 (1992), 467-488.
19. M. R. Garey and R. L. Graham, On cubical graphs, J. Combin. Theory, Ser. B, 18 (1975), 84-95.
20. R. L. Graham, Isometric embeddings of graphs, in: Selected Topics in Graph Theory III, L. W. Beineke and R. J. Wilson (eds), Academic Press, London, 1988, pp. 133-150.
21. R. L. Graham and P. M. Winkler, On isometric embedding of graphs, Trans. Am. Math. Soc., 288 (1985), 527-536.
22. J. Hagauer, Skeletons, recognition algorithm and distance matrix of quasi-median graphs, Int. J. Comput. Math., 55 (1995), 155-171.
23. J. Hagauer, W. Imrich and S. Klavžar, Recognizing graphs of windex 2, Preprint Series Univ. Ljubljana, vol. 31, 1993, p. 410.
24. W. Imrich, Embedding graphs into Cartesian products, Ann. N.Y. Acad. Sci., 576 (1989), 266-274.
25. W. Imrich and S. Klavžar, A simple O(mn) algorithm for recognizing Hamming graphs, Bull. Inst. Combin. Appl., 9 (1993), 45-56.
26. 2 log n) algorithm for recognizing median graphs, TR#89-4, Iowa State University, May 1989.
27. P. K. Jha and G. Slutzki, Convex-expansion algorithms for recognition of isometric embedding of median graphs, Ars Combin., 34 (1992), 75-92.
28. H. M. Mulder, The structure of median graphs, Discr. Math., 24 (1978), 197-204.
29. H. M. Mulder, The Interval Function of a Graph, Mathematical Centre Tracts 132, Mathematisch Centrum, Amsterdam, 1980.
30. R. L. Roth and P. M. Winkler, Collapse of the metric hierarchy for bipartite graphs, Europ. J. Combin., 7 (1986), 371-375.
31. S. V. Shpectorov, On scale embeddings of graphs into hypercubes, Europ. J. Combin., 14 (1993), 117-130.
32. E. Wilkeit, Isometric embeddings in Hamming graphs, J. Combin. Theory, Ser. B, 50 (1990), 179-197.
33. E. Wilkeit, The retracts of Hamming graphs, Discr. Math., 102 (1992) 197-218.
34. P. Winkler, Isometric embeddings in products of complete graphs, Discr. Appl. Math., 7 (1984), 221-225.
35. P. Winkler, The metric structure of a graph: theory and applications, in: Eleventh British Combinatorial Conference, Surveys in Combinatorics 1987, C. Whitehead (ed.), London Math. Soc. Lecture Note Series, vol. 123, Cambridge University Press, Cambridge, 1987, pp. 197-221.