Über das schwache kartesische Produkt von Graphen

Research output: Contribution to journalArticleResearchpeer-review

18 Citations (Scopus)

Abstract

It is shown that every connected graph has a unique prime factor decomposition with respect to the weak Cartesian product. The resulting close relationship between the automorphism group of a connected graph and the automorphism groups of its prime factors is used to derive theorems about the transitivity, regularity, and primitivity of these groups. With minor modifications all results also hold for set systems.
Original languageGerman
Pages (from-to)1-16
Number of pages16
JournalJournal of Combinatorial Theory, Series B
Volume11.1971
Issue number1
DOIs
Publication statusPublished - Aug 1971
Externally publishedYes

Cite this