Cyclic cycle systems of the complete multipartite graph
From MaRDI portal
Publication:6185560
DOI10.1002/jcd.21688arXiv1905.06180OpenAlexW2989774488MaRDI QIDQ6185560
Andrea C. Burgess, Tommaso Traetta, Francesca Merola
Publication date: 29 January 2024
Published in: Journal of Combinatorial Designs (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1905.06180
Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Related Items
Constructing generalized Heffter arrays via near alternating sign matrices, Mutually orthogonal cycle systems
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Infinitely many cyclic solutions to the Hamilton-Waterloo problem with odd length cycles
- Cyclic odd \(3K\)-cycle systems of the complete graph
- Decomposing complete equipartite graphs into odd square-length cycles: number of parts even
- Path and cycle decompositions of complete equipartite graphs: 3 and 5 parts
- Path and cycle decompositions of complete equipartite graphs: Four parts
- The spectrum of \((gv, g, 3, \lambda )\)-DF in \(Z_{gv}\)
- A non-existence result on cyclic cycle-decompositions of the cocktail party graph
- Edge partitions of complete multipartite graphs into equal length circuits
- Balanced incomplete block designs and related designs
- Skolem-type difference sets for cycle systems
- Cyclic Hamiltonian cycle systems of the complete graph.
- Cyclic uniform 2-factorizations of the complete multipartite graph
- Cycle decompositions of \(K_n\) and \(K_n-I\)
- Existence of cyclic \(k\)-cycle systems of the complete graph
- Decomposing complete equipartite graphs into short odd cycles
- Decompositions of complete multipartite graphs into cycles of even length
- \(C_{p}\)-decompositions of some regular graphs
- Cyclic Hamiltonian cycle systems of the complete graph minus a 1-factor
- Cycle decompositions III: Complete graphs and fixed length cycles
- Decomposing Complete Equipartite Multigraphs into Cycles of Variable Lengths: The Amalgamation-detachment Approach
- Decomposing complete equipartite graphs into odd square-length cycles: number of parts odd
- Decomposing complete equipartite graphs into short even cycles
- Cyclic even cycle systems of the complete graph
- Cyclicm-cycle systems withm ≤ 32 orm = 2q withq a prime power
- Decomposing complete equipartite graphs into cycles of length2p
- Strong difference families over arbitrary graphs
- Rotational k‐cycle systems of order v < 3k; another proof of the existence of odd cycle systems
- Cyclic $m$-cycle systems of complete graphs minus a 1-factor
- Cyclick-cycle systems of order 2kn +k: A solution of the last open cases
- Cyclic and symmetric hamiltonian cycle systems of the complete multipartite graph: even number of parts
