DECOMPOSITIONS OF COMPLETE MULTIPARTITE GRAPHS INTO GREGARIOUS 6-CYCLES USING COMPLETE DIFFERENCES
DOI10.4134/JKMS.2008.45.6.1623zbMATH Open1171.05006OpenAlexW2116529168MaRDI QIDQ3602134FDOQ3602134
Authors: Ronald Gould, Jung R. Cho 
Publication date: 12 February 2009
Published in: Journal of the Korean Mathematical Society (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.4134/jkms.2008.45.6.1623
Recommendations
- A NOTE ON DECOMPOSITION OF COMPLETE EQUIPARTITE GRAPHS INTO GREGARIOUS 6-CYCLES
- Resolvable gregarious cycle decompositions of complete equipartite graphs
- Circulant decompositions of certain multipartite graphs into Gregarious cycles of a given length
- A difference set method for circulant decompositions of complete partite graphs into gregarious 4-cycles
- Some gregarious cycle decompositions of complete equipartite graphs
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)
Cited In (7)
- A difference set method for circulant decompositions of complete partite graphs into gregarious 4-cycles
- Resolvable gregarious cycle decompositions of complete equipartite graphs
- Title not available (Why is that?)
- A NOTE ON DECOMPOSITION OF COMPLETE EQUIPARTITE GRAPHS INTO GREGARIOUS 6-CYCLES
- Six-cycle systems
- Title not available (Why is that?)
- Equipartite gregarious connected \((5,5)\)-graph systems
This page was built for publication: DECOMPOSITIONS OF COMPLETE MULTIPARTITE GRAPHS INTO GREGARIOUS 6-CYCLES USING COMPLETE DIFFERENCES
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3602134)
