Weak reconstruction of strong product graphs
From MaRDI portal
Publication:864154
DOI10.1016/j.disc.2005.09.049zbMath1110.05071OpenAlexW2028288677MaRDI QIDQ864154
Publication date: 13 February 2007
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2005.09.049
Related Items (5)
Robust Factorizations and Colorings of Tensor Graphs ⋮ On the Cartesian skeleton and the factorization of the strong product of digraphs ⋮ Arithmetic for rooted trees ⋮ Partial star products: a local covering approach for the recognition of approximate Cartesian product graphs ⋮ A local prime factor decomposition algorithm
Cites Work
- Finding the prime factors of strong direct product graphs in polynomial time
- Graph multiplication
- On the weak reconstruction of Cartesian-product graphs
- Weak k-reconstruction of Cartesian products
- Cardinal multiplication of structures with a reflexive relation
- Stability of cartesian products
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Weak reconstruction of strong product graphs