On Complete (s,t)-Cycle Systems of Complete Graphs

DOI10.1080/09720529.2013.842030zbMath1348.05107OpenAlexW2084330814MaRDI QIDQ2831827

Caikun Liu, Zhi-He Liang

Publication date: 3 November 2016

Published in: Journal of Discrete Mathematical Sciences and Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/09720529.2013.842030

zbMATH Keywords

cyclecomplete bipartite graphcomplete graphAlspach conjecture

Mathematics Subject Classification ID

Paths and cycles (05C38)

Cites Work

• On Alspach's conjecture
• Decomposition of K//(m,n)(K*//(m,n)) into cycles (circuits) of length 2k
• \((m,n)\)-cycle systems
• On Alspach's conjecture with two even cycle lengths
• Cycle decompositions of \(K_n\) and \(K_n-I\)
• Decomposition of \(K_{m, n}\) into 4-cycles and \(2t\)-cycles
• Cycle decompositions III: Complete graphs and fixed length cycles
• 3,5-Cycle decompositions
• Decompositions of complete graphs into triangles and Hamilton cycles
• Cycle decompositions of complete multigraphs

This page was built for publication: On Complete (s,t)-Cycle Systems of Complete Graphs