𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Factorization of an unconnected graph into a Cartesian product

✍ Scribed by K. A. Zaretskii

Publisher
Springer US
Year
1965
Tongue
English
Weight
62 KB
Volume
1
Category
Article
ISSN
1573-8337

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Embedding Cartesian Products of Graphs i
Embedding Cartesian Products of Graphs into de Bruijn Graphs
✍ Thomas Andreae; Michael NΓΆlle; Gerald Schreiber πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 172 KB

## Given a Cartesian product G of nontrivial connected graphs G i and the n-dimensional base B de Bruijn graph D = D B (n), it is investigated whether or not G is a spanning subgraph of D. Special attention is given to graphs G 1 Γ— β€’ β€’ β€’ Γ— G m which are relevant for parallel computing, namely, to

A theorem on integer flows on cartesian
A theorem on integer flows on cartesian products of graphs
✍ Wilfried Imrich; Riste Ε krekovski πŸ“‚ Article πŸ“… 2003 πŸ› John Wiley and Sons 🌐 English βš– 72 KB

## Abstract It is shown that the Cartesian product of two nontrivial connected graphs admits a nowhere‐zero 4‐flow. If both factors are bipartite, then the product admits a nowhere‐zero 3‐flow. Β© 2003 Wiley Periodicals, Inc. J Graph Theory 43: 93–98, 2003