Factorizations of product graphs into cycles of uniform length

DOI10.1007/BF01787423zbMath0822.05054WikidataQ114233928 ScholiaQ114233928MaRDI QIDQ1805375

P. Paulraja, Appu Muthusamy

Publication date: 15 October 1995

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

zbMATH Keywords

decompositioncyclesfactorization1-factorwreath productweak productshamiltonian cycles

Mathematics Subject Classification ID

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

Related Items (13)

\(C_7\)-decompositions of the tensor product of complete graphs ⋮ \(C_{p}\)-decompositions of some regular graphs ⋮ Kronecker products of paths and cycles: Decomposition, factorization and bi-pancyclicity ⋮ Unnamed Item ⋮ On the existence of k $k$‐cycle semiframes for even k $k$ ⋮ Unnamed Item ⋮ Solution to the outstanding case of the spouse‐loving variant of the Oberwolfach problem with uniform cycle length ⋮ Hamilton cycle decompositions of the tensor product of complete multipartite graphs ⋮ Decompositions of complete graphs into blown-up cycles \(C_m\)[2] ⋮ On resolvable multipartite \(G\)-designs. II ⋮ Resolvable even cycle decompositions of the tensor product of complete graphs ⋮ $C_4$-decomposition of the tensor product of complete graphs ⋮ Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Hamiltonian decompositions of complete regular s-partite graphs
• Hamiltonian decomposition of lexicographic product
• Hamilton decompositions of Cartesian products of graphs
• On decomposition of r-partite graphs into edge-disjoint Hamilton circuits
• The Oberwolfach problem and factors of uniform odd length cycles
• Hamiltonian Decompositions of Graphs, Directed Graphs and Hypergraphs

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