Cyclicm-cycle systems withm ≤ 32 orm = 2q withq a prime power
From MaRDI portal
Publication:3376672
DOI10.1002/JCD.20082zbMATH Open1085.05040OpenAlexW2154812413MaRDI QIDQ3376672FDOQ3376672
Authors: Shung-Liang Wu, Hung-Lin Fu 
Publication date: 24 March 2006
Published in: Journal of Combinatorial Designs (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jcd.20082
Recommendations
Cited In (20)
- On the existence of 5-Sun systems
- On the existence of \(k\)-sun systems
- Mutually orthogonal cycle systems
- Globally simple Heffter arrays and orthogonal cyclic cycle decompositions
- Title not available (Why is that?)
- A non-existence result on cyclic cycle-decompositions of the cocktail party graph
- Cyclic Hamiltonian cycle systems of the \(\lambda \)-fold complete and cocktail party graphs
- A note on cyclic \(m\)-cycle systems of \(K_{r(m)}\)
- A survey of Heffter arrays
- On the existence of elementary Abelian cycle systems
- Skolem-type difference sets for cycle systems
- \(2m\)-cycle systems of \(K_{2m+1}\backslash C_m\)
- Cyclic cycle systems of the complete multipartite graph
- Arc-transitive cycle decompositions of tetravalent graphs
- A note on \(\alpha \)-labelings of \(2k\)-sun graphs
- Maximum cyclic 4-cycle packings of the complete multipartite graph
- Signed Langford sequences and directed cyclic cycle systems
- Cyclic Hamiltonian cycle systems of the complete graph minus a 1-factor
- On the existence of a cyclic near-resolvable \((6n+4)\)-cycle system of \(2 K_{12n+9}\)
- Cyclic even cycle systems of the complete graph
This page was built for publication: Cyclicm-cycle systems withm ≤ 32 orm = 2q withq a prime power
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3376672)
