On the weak reconstruction of Cartesian-product graphs

DOI10.1016/0012-365X(95)00185-YzbMath0858.05076OpenAlexW2038224452MaRDI QIDQ1916107

Wilfried Imrich, Janez Žerovnik

Publication date: 23 March 1997

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0012-365x(95)00185-y

zbMATH Keywords

reconstructionprime factorconvex subgraphCartesian-product graphmembership recognition problemproduct square

Mathematics Subject Classification ID

Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Related Items (6)

Weak reconstruction of strong product graphs ⋮ Partial star products: a local covering approach for the recognition of approximate Cartesian product graphs ⋮ A local prime factor decomposition algorithm ⋮ Unnamed Item ⋮ Factoring cardinal product graphs in polynomial time ⋮ Weak k-reconstruction of cartesian product graphs

Cites Work

• Graph multiplication
• A polynomial time algorithm for finding the prime factors of Cartesian- product graphs
• Cartesian graph factorization at logarithmic cost per edge
• On Factorable Extensions and Subgraphs of Prime Graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On the weak reconstruction of Cartesian-product graphs