Equipartite gregarious 6- and 8-cycle systems

DOI10.1016/j.disc.2006.09.016zbMath1115.05068OpenAlexW2020197965MaRDI QIDQ879343

Benjamin R. Smith, D. G. Hoffman, Elizabeth J. Billington

Publication date: 11 May 2007

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

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

zbMATH Keywords

graph decompositioncomplete multipartite graphequipartite graphgregarious cycle

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 connected \((5,5)\)-graph systems ⋮ Equipartite gregarious 5-cycle systems and other results ⋮ Six-cycle systems

Cites Work

• Unnamed Item
• Resolvable gregarious cycle decompositions of complete equipartite graphs
• Decomposition of K//(m,n)(K*//(m,n)) into cycles (circuits) of length 2k
• Another class of balanced graph designs: Balanced circuit designs
• Cycle decompositions of \(K_n\) and \(K_n-I\)
• Decomposition of complete tripartite graphs into gregarious 4-cycles
• Decompositions of complete multipartite graphs into cycles of even length
• \(C_{p}\)-decompositions of some regular graphs
• Equipartite and almost-equipartite gregarious 4-cycle systems
• Cycle decompositions III: Complete graphs and fixed length cycles

This page was built for publication: Equipartite gregarious 6- and 8-cycle systems