Decomposition of complete tripartite graphs into gregarious 4-cycles

DOI10.1016/S0012-365X(02)00462-4zbMath1008.05121OpenAlexW2027094827MaRDI QIDQ1861283

Elizabeth J. Billington, D. G. Hoffman

Publication date: 16 March 2003

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

Full work available at URL: https://doi.org/10.1016/s0012-365x(02)00462-4

zbMATH Keywords

graph decomposition4-cyclecomplete tripartite graph

Mathematics Subject Classification ID

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

Related Items (4)

Equipartite gregarious 6- and 8-cycle systems ⋮ Equipartite gregarious connected \((5,5)\)-graph systems ⋮ Resolvable gregarious cycle decompositions of complete equipartite graphs ⋮ Equipartite and almost-equipartite gregarious 4-cycle systems

This page was built for publication: Decomposition of complete tripartite graphs into gregarious 4-cycles