Decomposing complete equipartite graphs into odd square-length cycles: number of parts odd

DOI10.1002/jcd.20268zbMath1208.05118OpenAlexW2118469637WikidataQ114236277 ScholiaQ114236277MaRDI QIDQ3057083

Benjamin R. Smith

Publication date: 24 November 2010

Published in: Journal of Combinatorial Designs (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jcd.20268

zbMATH Keywords

multigraphcycle decompositionsmultipartite graph

Mathematics Subject Classification ID

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

Related Items

\(C_7\)-decompositions of the tensor product of complete graphs ⋮ \(C_{4p}\)-frame of complete multipartite multigraphs ⋮ \(2p\)-cycle decompositions of some regular graphs and digraphs ⋮ Unnamed Item ⋮ Cyclic cycle systems of the complete multipartite graph ⋮ Decomposing Complete Equipartite Multigraphs into Cycles of Variable Lengths: The Amalgamation-detachment Approach ⋮ Decompositions of some classes of dense graphs into cycles of lengths 4 and 8 ⋮ Decomposing complete equipartite graphs into short even cycles ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Decomposition of complete equipartite graphs into paths and cycles of length \(2p\)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Decomposing complete equipartite graphs into odd square-length cycles: number of parts even
• Path and cycle decompositions of complete equipartite graphs: 3 and 5 parts
• Path and cycle decompositions of complete equipartite graphs: Four parts
• Decomposition of K//(m,n)(K*//(m,n)) into cycles (circuits) of length 2k
• On decomposing \(K_n -I\) into cycles of a fixed odd length
• Decompositions of complete multipartite graphs into cycles of even length
• \(C_{p}\)-decompositions of some regular graphs
• Decomposing complete equipartite graphs into cycles of length2p
• Cycle decompositions of complete multigraphs