Weak reconstruction of strong product graphs
type: Item
instance of: scholarly article
title: Weak reconstruction of strong product graphs
zbMATH Open document ID: 1110.05071
author: Blaž Zmazek
author: Janez Žerovnik
published in: Discrete Mathematics
publication date: 2007-02-13T00:00:00Z
Mathematics Subject Classification ID: 05C60
zbMATH DE Number: 5124979
zbMATH Keywords: composite graphs
MaRDI profile type: Publication
full work available at URL: j.disc.2005.09.049
OpenAlex ID: W2028288677
cites work: Q4063492
cites work: Q5590666
cites work: Finding the prime factors of strong direct product graphs in polynomial time
cites work: Q3088443
cites work: Q4523707
cites work: On the weak reconstruction of Cartesian-product graphs
cites work: Weak k-reconstruction of Cartesian products
cites work: Cardinal multiplication of structures with a reflexive relation
cites work: Graph multiplication
cites work: Stability of cartesian products
cites work: Q3259049
DOI: 10.1016/J.DISC.2005.09.049
Recommended article: On the weak reconstruction of Cartesian-product graphs
Recommended article: Weak k-reconstruction of Cartesian products
Recommended article: Retracts of strong products of graphs
Recommended article: Strongly perfect products of graphs
Recommended article: Q4865480
Recommended article: On weak direct product decompositions of lattices and graphs
Recommended article: Q4906801
Recommended article: Q5403617
Recommended article: Connectivity of strong products of graphs
Recommended article: Some properties of the weak product of graphs on lattices
description: scientific article; zbMATH DE number 5124979