Decompositions of complete graphs into blown-up cycles C_m[2]
From MaRDI portal
Publication:966036
Recommendations
- Cycle decompositions. V: Complete graphs into cycles of arbitrary lengths
- Cyclically decomposing the complete graph into 2-regular graphs
- \(2m\)-cycle systems of \(K_{2m+1}\backslash C_m\)
- Cyclically decomposing the complete graph into cycles
- An asymptotic solution to the cycle decomposition problem for complete graphs
Cites work
- Cycle decompositions of K_n and K_n-I
- Cycle decompositions of complete graphs
- Cycle decompositions. III: Complete graphs and fixed length cycles.
- Decomposition of K//(m,n)(K*//(m,n)) into cycles (circuits) of length 2k
- Decompositions of complete multipartite graphs into cycles of even length
- Edge partitions of complete multipartite graphs into equal length circuits
- Factorizations of product graphs into cycles of uniform length
- scientific article; zbMATH DE number 3922695 (Why is no real title available?)
- scientific article; zbMATH DE number 3675916 (Why is no real title available?)
- scientific article; zbMATH DE number 1229616 (Why is no real title available?)
- scientific article; zbMATH DE number 786153 (Why is no real title available?)
- scientific article; zbMATH DE number 3308125 (Why is no real title available?)
- The CRC handbook of combinatorial designs
Cited in
(4)
This page was built for publication: Decompositions of complete graphs into blown-up cycles \(C_m\)[2]
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q966036)