×

zbMATH — the first resource for mathematics

Different types of products and subdirectly irreducible graphs. (English) Zbl 0614.05051
Subdirect irreducibility of undirected graphs without loops and multiple edges is studied for three types of products-categorial, Cartesian and mixed ones. For categorial and mixed products full characterizations of subdirectly irreducible graphs are given.
Reviewer: M.Demlová
MSC:
05C99 Graph theory
PDF BibTeX XML Cite
Full Text: EuDML