Cyclic cycle systems of the complete multipartite graph
From MaRDI portal
Abstract: In this paper, we study the existence problem for cyclic -cycle decompositions of the graph , the complete multipartite graph with parts of size , and give necessary and sufficient conditions for their existence in the case that .
Recommendations
- scientific article; zbMATH DE number 5177321
- Decompositions of complete multipartite graphs into cycles of even length
- Cyclic and symmetric Hamiltonian cycle systems of the complete multipartite graph: even number of parts
- Cycle decompositions of complete multigraphs
- Resolvable gregarious cycle decompositions of complete equipartite graphs
Cites work
- \(C_{p}\)-decompositions of some regular graphs
- A non-existence result on cyclic cycle-decompositions of the cocktail party graph
- Balanced incomplete block designs and related designs
- Cycle decompositions of K_n and K_n-I
- Cycle decompositions. III: Complete graphs and fixed length cycles.
- Cyclic m-cycle systems of complete graphs minus a 1-factor
- Cyclic and symmetric Hamiltonian cycle systems of the complete multipartite graph: even number of parts
- Cyclic even cycle systems of the complete graph
- Cyclic Hamiltonian cycle systems of the complete graph minus a 1-factor
- Cyclic Hamiltonian cycle systems of the complete graph.
- Cyclic odd 3K-cycle systems of the complete graph
- Cyclic uniform 2-factorizations of the complete multipartite graph
- Cyclick-cycle systems of order 2kn +k: A solution of the last open cases
- Cyclicm-cycle systems withm ≤ 32 orm = 2q withq a prime power
- Decomposing complete equipartite graphs into cycles of length2p
- Decomposing complete equipartite graphs into odd square-length cycles: number of parts even
- Decomposing complete equipartite graphs into odd square-length cycles: number of parts odd
- Decomposing complete equipartite graphs into short even cycles
- Decomposing complete equipartite graphs into short odd cycles
- Decomposing complete equipartite multigraphs into cycles of variable lengths: the amalgamation-detachment approach
- Decompositions of complete multipartite graphs into cycles of even length
- Edge partitions of complete multipartite graphs into equal length circuits
- Existence of cyclic \(k\)-cycle systems of the complete graph
- scientific article; zbMATH DE number 53885 (Why is no real title available?)
- scientific article; zbMATH DE number 1229616 (Why is no real title available?)
- scientific article; zbMATH DE number 1343531 (Why is no real title available?)
- scientific article; zbMATH DE number 867473 (Why is no real title available?)
- scientific article; zbMATH DE number 3218576 (Why is no real title available?)
- scientific article; zbMATH DE number 5038480 (Why is no real title available?)
- scientific article; zbMATH DE number 3238443 (Why is no real title available?)
- Infinitely many cyclic solutions to the Hamilton-Waterloo problem with odd length cycles
- Path and cycle decompositions of complete equipartite graphs: 3 and 5 parts
- Path and cycle decompositions of complete equipartite graphs: Four parts
- Rotational k‐cycle systems of order v < 3k; another proof of the existence of odd cycle systems
- Skolem-type difference sets for cycle systems
- Strong difference families over arbitrary graphs
- The spectrum of \((gv, g, 3, \lambda )\)-DF in \(Z_{gv}\)
Cited in
(3)
This page was built for publication: Cyclic cycle systems of the complete multipartite graph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6185560)
