Decomposing complete tripartite graphs into cycles of lengths 3 and 4

DOI10.1016/S0012-365X(99)90049-3zbMATH Open0930.05072OpenAlexW4251623959MaRDI QIDQ1292817FDOQ1292817

Authors: 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

Recommendations

• Decompositions of complete tripartite graphs into cycles of lengths 3 and 6
• Decomposition of complete tripartite graphs into cycles and paths of length three
• Decomposition of complete tripartite graphs into gregarious 3-paths and 6-cycles
• Path and cycle decompositions of complete equipartite graphs: 3 and 5 parts
• On cyclic decompositions of complete graphs into tripartite graphs

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)

Cites Work

• Decomposition of K//(m,n)(K*//(m,n)) into cycles (circuits) of length 2k
• Title not available (Why is that?)
• Decompositions of complete multipartite graphs into cycles of even length
• Title not available (Why is that?)
• On Alspach's conjecture

Cited In (23)

• Cycle decomposition of 2-fold complete tripartite graphs and generalized pseudo-characteristic
• Decomposing complete tripartite graphs into closed trails of arbitrary lengths
• Title not available (Why is that?)
• Title not available (Why is that?)
• Path and cycle decompositions of complete equipartite graphs: 3 and 5 parts
• Decomposition of complete Tripartite graphs into triangles and claws
• On decomposing complete tripartite graphs into 5-cycles
• Mandatory decompositions of complete multipartite graphs into cycles of lengths 3 and \(2k (k\geq 4)\)
• 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
• Decomposition of the tensor product of complete graphs into cycles of lengths 3 and 6
• Decomposition of complete tripartite graphs into gregarious 3-paths and 6-cycles
• On complete tripartite graphs arbitrarily decomposable into closed trails
• Title not available (Why is that?)
• \(C_{p}\)-decompositions of some regular graphs
• Maximum cyclic 4-cycle packings of the complete multipartite graph
• Title not available (Why is that?)
• Decomposition of complete tripartite graphs into gregarious 4-cycles
• Decomposing complete tripartite graphs into 5-cycles when the partite sets have similar size
• $C_4$-decomposition of the tensor product of complete graphs
• Title not available (Why is that?)
• Title not available (Why is that?)
• \(C_7\)-decompositions of the tensor product of complete graphs

This page was built for publication: Decomposing complete tripartite graphs into cycles of lengths 3 and 4

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