Further decompositions of complete tripartite graphs into 5-cycles
From MaRDI portal
Publication:1849912
DOI10.1016/S0012-365X(01)00462-9zbMath1009.05108OpenAlexW2091102675MaRDI QIDQ1849912
Publication date: 2 December 2002
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0012-365x(01)00462-9
Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Related Items
Decomposing complete tripartite graphs into 5-cycles when the partite sets have similar size, Maximum cyclic 4-cycle packings of the complete multipartite graph, Equipartite gregarious 5-cycle systems and other results, Decomposing complete tripartite graphs into closed trails of arbitrary lengths, Unnamed Item, Some equitably 3-colourable cycle decompositions of complete equipartite graphs
