Decomposing complete tripartite graphs into cycles of lengths 3 and 4

DOI10.1016/S0012-365X(99)90049-3zbMath0930.05072OpenAlexW4251623959MaRDI QIDQ1292817

Elizabeth J. Billington

Publication date: 30 January 2000

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

Full work available at URL: https://doi.org/10.1016/s0012-365x(99)90049-3

zbMATH Keywords

decompositioncyclecomplete graph

Mathematics Subject Classification ID

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

Related Items

\(C_7\)-decompositions of the tensor product of complete graphs, \(C_{p}\)-decompositions of some regular graphs, Decomposition of the tensor product of complete graphs into cycles of lengths 3 and 6, Maximum cyclic 4-cycle packings of the complete multipartite graph, $C_4$-decomposition of the tensor product of complete graphs, Decomposing complete tripartite graphs into closed trails of arbitrary lengths, Decompositions of some classes of dense graphs into cycles of lengths 4 and 8, Decomposition of complete tripartite graphs into cycles and paths of length three, Unnamed Item, Unnamed Item

Cites Work

• On Alspach's conjecture
• Decomposition of K//(m,n)(K*//(m,n)) into cycles (circuits) of length 2k
• Decompositions of complete multipartite graphs into cycles of even length
• Unnamed Item
• Unnamed Item