3,5-Cycle decompositions

DOI10.1002/(SICI)1520-6610(1998)6:2%3C91::AID-JCD2%3E3.0.CO;2-QzbMATH Open0910.05052OpenAlexW2088720699MaRDI QIDQ4222124FDOQ4222124

Authors: Darryn Bryant, P. Adams, Abdollah Khodkar 

Publication date: 25 March 1999

Full work available at URL: https://doi.org/10.1002/(sici)1520-6610(1998)6:2%3C91::aid-jcd2%3E3.0.co;2-q

Recommendations

• The problem of decomposing a complete tripartite graph into \(5\)-cycles
• Decomposing complete tripartite graphs into 5-cycles when the partite sets have similar size
• scientific article; zbMATH DE number 1556758
• Cycle decompositions. V: Complete graphs into cycles of arbitrary lengths

zbMATH Keywords

cycle decomposition

Mathematics Subject Classification ID

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

Cited In (6)

• On Complete (s,t)-Cycle Systems of Complete Graphs
• Decomposition of complete graphs into cycles and stars
• \((m,n)\)-cycle systems
• Decompositions of graphs into 5-cycles and other small graphs
• Decomposing complete tripartite graphs into 5-cycles when the partite sets have similar size
• 5-cycle decompositions from paired 3- and 4-cycle decompositions

This page was built for publication: 3,5-Cycle decompositions

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