Factorizations of product graphs into cycles of uniform length

DOI10.1007/BF01787423MaRDI QIDQ1805375zbMATH OpenWikidataFDO

Authors P. Paulraja, A. Muthusamy

Publication date 15 October 1995

Published in Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BF01787423

zbMATH Keywords

1-factorcyclesdecompositionfactorizationhamiltonian cyclesweak productswreath product

Mathematics Subject Classification ID

Paths and cycles (05C38) Eulerian and Hamiltonian graphs (05C45) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Review text

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.

Recommendations

• scientific article; zbMATH DE number 5549
• Hamiltonian decompositions of products of cycles
• scientific article; zbMATH DE number 2197884

Cites work

• Hamilton decompositions of Cartesian products of graphs
• Hamiltonian decomposition of lexicographic product
• Hamiltonian decompositions of complete regular s-partite graphs
• Hamiltonian Decompositions of Graphs, Directed Graphs and Hypergraphs
• scientific article; zbMATH DE number 4173021 (Why is no real title available?)
• scientific article; zbMATH DE number 3950583 (Why is no real title available?)
• On decomposition of r-partite graphs into edge-disjoint Hamilton circuits
• The Oberwolfach problem and factors of uniform odd length cycles

Cited in

(20)

• Kronecker products of paths and cycles: Decomposition, factorization and bi-pancyclicity
• On decomposition of the Cartesian product of directed cycles into cycles of equal lengths
• Resolvable even cycle decompositions of the tensor product of complete graphs
• \(C_7\)-decompositions of the tensor product of complete graphs
• \(C_{p}\)-decompositions of some regular graphs
• Unextendible product bases and 1-factorization of complete graphs
• On resolvable multipartite \(G\)-designs. II
• scientific article; zbMATH DE number 5575592 (Why is no real title available?)
• scientific article; zbMATH DE number 3906540 (Why is no real title available?)
• scientific article; zbMATH DE number 5549 (Why is no real title available?)
• C₄ decomposition of the tensor product of complete graphs
• Decompositions of some classes of regular graphs and digraphs into cycles of length 4p
• p^2-cycle decompositions of the tensor product of complete graphs
• scientific article; zbMATH DE number 7593862 (Why is no real title available?)
• On the existence of k k‐cycle semiframes for even k k
• Solution to the outstanding case of the spouse‐loving variant of the Oberwolfach problem with uniform cycle length
• The generating graph of some monolithic groups.
• Almost resolvable even cycle decompositions of ( K_u K_g)()
• Hamilton cycle decompositions of the tensor product of complete multipartite graphs
• Decompositions of complete graphs into blown-up cycles \(C_m\)[2]

This page was built for publication: Factorizations of product graphs into cycles of uniform length

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1805375)