Decomposing complete tripartite graphs into 5-cycles when the partite sets have similar size
From MaRDI portal
Publication:657830
DOI10.1007/S00010-011-0098-6zbMATH Open1233.05070OpenAlexW2039926741MaRDI QIDQ657830FDOQ657830
Authors: Elizabeth J. Billington, Nicholas J. Cavenagh 
Publication date: 10 January 2012
Published in: Aequationes Mathematicae (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00010-011-0098-6
Recommendations
- On decomposing complete tripartite graphs into 5-cycles
- scientific article; zbMATH DE number 1556758
- Further decompositions of complete tripartite graphs into 5-cycles
- The problem of decomposing a complete tripartite graph into \(5\)-cycles
- Path and cycle decompositions of complete equipartite graphs: 3 and 5 parts
- scientific article; zbMATH DE number 1229616
- Decomposing complete tripartite graphs into cycles of lengths 3 and 4
- Decomposing complete equipartite graphs into cycles of length2p
- Complete equipartite \(3p\)-cycle systems
- 3,5-Cycle decompositions
Cites Work
Cited In (8)
- Further decompositions of complete tripartite graphs into 5-cycles
- On Eulerian regular complete 5-partite graphs and a cycle decomposition problem
- Decomposition of complete Tripartite graphs into triangles and claws
- The problem of decomposing a complete tripartite graph into \(5\)-cycles
- On decomposing complete tripartite graphs into 5-cycles
- Decompositions of complete tripartite graphs into cycles of lengths 3 and 6
- Decomposition of complete tripartite graphs into cycles and paths of length three
- Title not available (Why is that?)
This page was built for publication: Decomposing complete tripartite graphs into 5-cycles when the partite sets have similar size
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q657830)
