Resolvable gregarious cycle decompositions of complete equipartite graphs

DOI10.1016/j.disc.2006.06.047zbMath1143.05062OpenAlexW2085334190MaRDI QIDQ924973

D. G. Hoffman, Elizabeth J. Billington, C. A. Rodger

Publication date: 29 May 2008

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

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

zbMATH Keywords

complete multipartite graphgregarious cycle decompositionresolvable decomposition

Mathematics Subject Classification ID

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

Related Items

Equipartite gregarious 6- and 8-cycle systems, Equipartite gregarious connected \((5,5)\)-graph systems

Cites Work

• Unnamed Item
• Unnamed Item
• Cycle decompositions of \(K_n\) and \(K_n-I\)
• Decomposition of complete tripartite graphs into gregarious 4-cycles
• Nondisconnecting disentanglements of amalgamated 2-factorizations of complete multipartite graphs
• Cycle decompositions III: Complete graphs and fixed length cycles