Factorizations of product graphs into cycles of uniform length (Q1805375)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Factorizations of product graphs into cycles of uniform length |
scientific article; zbMATH DE number 754152
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Factorizations of product graphs into cycles of uniform length |
scientific article; zbMATH DE number 754152 |
Statements
Factorizations of product graphs into cycles of uniform length (English)
0 references
15 October 1995
0 references
The following problem is considered. If a graph \(G_ 1\) has a decomposition into hamiltonian cycles and a 1-factor, and \(G_ 2\) has a decomposition into hamiltonian cycles, does their wreath product \(G_ 1* G_ 2\) admit a hamiltonian cycle decomposition? The authors give some partial results. They consider also the Cartesian and the weak products as well as the decomposition into cycles of the same length.
0 references
factorization
0 references
decomposition
0 references
hamiltonian cycles
0 references
1-factor
0 references
wreath product
0 references
weak products
0 references
cycles
0 references
