Weak k-reconstruction of cartesian product graphs

DOI10.1016/S1571-0653(04)00414-7zbMath1184.05083OpenAlexW2036707640MaRDI QIDQ3439000

Blaž Zmazek, Janez Žerovnik, Wilfried Imrich

Publication date: 29 May 2007

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

Full work available at URL: https://doi.org/10.1016/s1571-0653(04)00414-7

Mathematics Subject Classification ID

Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Graph operations (line graphs, products, etc.) (05C76)

Related Items (2)

Partial star products: a local covering approach for the recognition of approximate Cartesian product graphs ⋮ A local prime factor decomposition algorithm

Cites Work

• On the weak reconstruction of Cartesian-product graphs
• On Factorable Extensions and Subgraphs of Prime Graphs
• Stability of cartesian products
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Weak k-reconstruction of cartesian product graphs