On the weak reconstruction of Cartesian-product graphs

Discrete Mathematics

Volumn 150, Issue 1-3, 1996, Pages 167-178

  Imrich, Wilfried ^a   Žerovnik, Janez ^b  

^a UNIVERSITY OF LEOBEN   (Austria)

^b UNIVERSITY OF MARIBOR   (Slovenia)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0041630475     PISSN: 0012365X     EISSN: None     Source Type: Journal    
DOI: 10.1016/0012-365X(95)00185-Y     Document Type: Article

References (7)

1. F. Aurenhammer, J. Hagauer and 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) 361-383.
3. J. Feigenbaum, J. Herschberger and A.A. Schäffer, A polynomial time algorithm for finding the prime factors of Cartesian-Product graphs, Discrete Appl. Math. 12 (1985) 123-138.
4. J. Feigenbaum and R. Haddad, On factorable extensions and subgraphs of prime graphs, SIAM J. Discrete. Math. 2 (1989) 197-218.
5. W. Imrich, Embedding graphs into Cartesian products, Graph Theory and Applications: East and West, Ann. N.Y. Acad. Sci. Vol. 576 (1989) 266-274.
6. G. Sabidussi, Graph multiplication, Math, Z. 72 (1960) 446-457.
7. S.M. Ulam, A Collection of Mathematical Problems (Wiley, New York, 1960) 29.