Path and cycle decompositions of complete equipartite graphs: Four parts

DOI10.1016/j.disc.2008.08.009zbMath1202.05070OpenAlexW2030740204MaRDI QIDQ1025923

Nicholas J. Cavenagh, Benjamin R. Smith, Elizabeth J. Billington

Publication date: 23 June 2009

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2008.08.009

zbMATH Keywords

path decompositioncycle decompositioncomplete equipartite 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_{4p}\)-frame of complete multipartite multigraphs, Decomposing complete equipartite graphs into odd square-length cycles: number of parts even, Cyclic cycle systems of the complete multipartite graph, Path and cycle decompositions of complete equipartite graphs: 3 and 5 parts, Decomposing complete equipartite graphs into odd square-length cycles: number of parts odd, 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, Decomposition of complete equipartite graphs into paths and cycles of length \(2p\)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Path and cycle decompositions of complete equipartite graphs: 3 and 5 parts
• Decomposition of K//(m,n)(K*//(m,n)) into cycles (circuits) of length 2k
• Decomposition of a complete multigraph into simple paths: nonbalanced handcuffed designs
• Cycle decompositions of \(K_n\) and \(K_n-I\)
• The equipartite Oberwolfach problem with uniform tables
• Decompositions of complete multipartite graphs into cycles of even length
• \(C_{p}\)-decompositions of some regular graphs
• Nondisconnecting disentanglements of amalgamated 2-factorizations of complete multipartite graphs
• Cycle decompositions III: Complete graphs and fixed length cycles
• Decomposing complete equipartite graphs into cycles of length2p