A difference set method for circulant decompositions of complete partite graphs into gregarious 4-cycles

MaRDI QIDQ3172488zbMATH OpenFDO

Authors Eunkyung Kim, Youngmin Cho, Jung R. Cho

Publication date 5 October 2011

zbMATH Keywords

multipartite graphgregarious cyclecirculant decomposition

Mathematics Subject Classification ID

Combinatorial aspects of difference sets (number-theoretic, group-theoretic, etc.) (05B10) Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• Equipartite and almost-equipartite gregarious 4-cycle systems
• Circulant decompositions of certain multipartite graphs into Gregarious cycles of a given length
• DECOMPOSITIONS OF COMPLETE MULTIPARTITE GRAPHS INTO GREGARIOUS 6-CYCLES USING COMPLETE DIFFERENCES
• A REMARK ON CIRCULANT DECOMPOSITIONS OF COMPLETE MULTIPARTITE GRAPHS BY GREGARIOUS CYCLES
• Resolvable gregarious cycle decompositions of complete equipartite graphs

Cited in

(4)

• DECOMPOSITIONS OF COMPLETE MULTIPARTITE GRAPHS INTO GREGARIOUS 6-CYCLES USING COMPLETE DIFFERENCES
• Equipartite and almost-equipartite gregarious 4-cycle systems
• Decomposition of complete tripartite graphs into gregarious 4-cycles
• Circulant decompositions of certain multipartite graphs into Gregarious cycles of a given length

This page was built for publication: A difference set method for circulant decompositions of complete partite graphs into gregarious 4-cycles

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3172488)