Factoring cardinal product graphs in polynomial time

Discrete Mathematics

Volumn 192, Issue 1-3, 1998, Pages 119-144

  Imrich, Wilfried ^a  

^a UNIVERSITY OF LEOBEN   (Austria)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0006682108     PISSN: 0012365X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0012-365X(98)00069-7     Document Type: Article

References (29)

1. F. Aurenhammer, J. Hagauer, W. Imrich, Cartesian graph factorization at logarithmic cost per edge, Comput. Complexity 2 (1992) 331-349.
2. W. Dörfler, Some results on the reconstruction of graphs, in: Colloq. Math. Soc. János Bolyai, vol. 10 Keszthely, Hungary, 1973, pp. 361-383.
3. W. Dörfler, Primfaktorzerlegung und Automorphismen des Kardinalproduktes von Graphen, Glas. Mat. 9 (1974) 15-27.
4. W. Dörfler, W. Imrich, Über das starke Produkt von endlichen Graphen, Österreich. Akad. Wiss. Math. Naturw. K1. S.-B. II 178 (1970) 247-262.
5. T. Feder, Product graph representations, J. Graph Theory 16 (1992) 467-488.
6. J. Feigenbaum, J. Herschberger, A. A. Schäffer A polynomial time algorithm for finding the prime factors of Cartesian-product graphs, Discrete Appl. Math. 12 (1985) 123-138.
7. J. Feigenbaum, A.A. Schäffer, Finding the prime factors of strong direct products of graphs in polynomial time, Discrete Math. 109 (1992) 77-102.
8. R. Graham, P. Winkler, On isometric embeddings of graphs, Trans. Amer. Math. Soc. 288 (1985) 527-536.
9. J. Hashimoto, T. Nakayama, On a problem of G. Birkhoff, Proc. Amer. Math. Soc. 1 (1950) 141-142.
10. W. Imrich, Automorphismen und das kartesische Produkt von Graphen, Österreich. Akad. Wiss. Math. Natur. K1. S.-B. II. 177 (1969) 203-214.
11. W. Imrich, Über das schwache kartesische Produkt von Graphen, J. Combin. Theory Ser. B 11 (1971) 1-16.
12. W. Imrich, Assoziative Produkte von Graphen, Österreich. Akad. Wiss. Math. Natur. K1. S.-B. II. 180 (1971) 203-239.
13. W. Imrich, Embedding graphs into Cartesian products, graph theory and applications: east and west, Ann. New York Acad. Sci. 576 (1989) 266-274.
14. W. Imrich, H. Izbicki, Associative products of graphs, Monatsh. Math. 80 (1975) 277-281.
15. W. Imrich, S. Klavžar, On the complexity of recognizing Hamming graphs and related classes of graphs, European. J. Combin. 17 (1996) 209-221.
16. W. Imrich, A. Pultr, Classification of tensor products of symmetric graphs, Comment. Math. Carolin. 32 (1991) 315-322.
17. W. Imrich, J. Žerovnik, On the weak reconstruction of Cartesian-product graphs, Discrete Mathematics 150 (1996) 167-178.
18. P. K. Jha, S. Klavžar, B. Zmazek, Isomorphic components of Kronecker products of bipartite graphs, Discuss. Math. Graph Theory 17 (1997) 301-309.
19. R. McKenzie, Cardinal multiplication of structures with a reflexive relation, Fund. Math. 70 (1971) 59-101.
20. D.J. Miller, The categorical product of graphs, Canad. J. Math. 20 (1968) 1511-1521.
21. D.J. Miller, The automorphism group of a product of graphs, Proc. Amer. Math. Soc. 25 (1970) 24-28.
22. G. Sabidussi, Graph multiplication, Math. Z. 72 (1960) 446-457.
23. n, J. Combin. Math. Combin. Comput., in press.
24. I.J. Schönberg, Metric spaces and positive definite functions, Trans. Amer. Math. Soc. 44 (1938) 522-536.
25. V.G. Vizing, The Cartesian product of graphs (in Russian), Vychisl. Sistemy 9 (1963) 30-43. [English translation: Comp. El. Syst. 2 (1966) 352-365.]
26. V.G. Vizing, The Cartesian product of graphs (in Russian), Vychisl. Sistemy 9 (1963) 30-43. [English translation: Comp. El. Syst. 2 (1966) 352-365.]
27. P.M. Weichsel, The Kronecker product of graphs, Proc. Amer. Math. Soc. 13 (1961) 47-52.
28. P.M. Winkler, Factoring a graph in polynomial time, European J. Combin. 8 (1987) 209-212.
29. H.S. Witsenhausen, Minimum dimension embedding of finite metric spaces, J. Combin. Theory Ser. A 42 (1986) 184-199.