Decomposing complete tripartite graphs into cycles of lengths 3 and 4

DOI10.1016/S0012-365X(99)90049-3MaRDI QIDQ1292817zbMATHOpenAlexFDO

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

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)

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

Cites work

• scientific article; zbMATH DE number 124520 (Why is no real title available?)
• scientific article; zbMATH DE number 828005 (Why is no real title available?)
• Decomposition of K//(m,n)(K*//(m,n)) into cycles (circuits) of length 2k
• Decompositions of complete multipartite graphs into cycles of even length
• On Alspach's conjecture

Cited in

(26)

• The irredundance-related Ramsey numbers \(s(3,8)=21\) and \(w(3,8)=21\)
• \(C_{p}\)-decompositions of some regular graphs
• Decompositions of complete tripartite graphs into cycles of lengths 3 and 6
• Decompositions of some classes of dense graphs into cycles of lengths 4 and 8
• scientific article; zbMATH DE number 7362657 (Why is no real title available?)
• scientific article; zbMATH DE number 7274058 (Why is no real title available?)
• On decomposing complete tripartite graphs into 5-cycles
• Path and cycle decompositions of complete equipartite graphs: 3 and 5 parts
• Maximum cyclic 4-cycle packings of the complete multipartite graph
• Cycle decomposition of 2-fold complete tripartite graphs and generalized pseudo-characteristic
• Decomposition of complete tripartite graphs into cycles and paths of length three
• Mandatory decompositions of complete multipartite graphs into cycles of lengths 3 and \(2k (k\geq 4)\)
• Decomposition of complete tripartite graphs into short cycles.
• On complete tripartite graphs arbitrarily decomposable into closed trails
• Decomposition of complete tripartite graphs into gregarious 4-cycles
• scientific article; zbMATH DE number 2024685 (Why is no real title available?)
• Decomposing complete tripartite graphs into closed trails of arbitrary lengths
• Decompositions of complete equipartite graphs into cycles of lengths 3 and 6
• \(C_4\) decomposition of the tensor product of complete graphs
• scientific article; zbMATH DE number 5226688 (Why is no real title available?)
• \(C_7\)-decompositions of the tensor product of complete graphs
• Decomposition of the tensor product of complete graphs into cycles of lengths 3 and 6
• Decomposition of complete Tripartite graphs into triangles and claws
• Decomposing complete tripartite graphs into 5-cycles when the partite sets have similar size
• Decomposition of complete tripartite graphs into gregarious 3-paths and 6-cycles
• Decomposition of complete graphs into tri-cyclic graphs with eight edges

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)