Skolem-type difference sets for cycle systems
From MaRDI portal
Recommendations
Cited in
(27)- A non-existence result on cyclic cycle-decompositions of the cocktail party graph
- Maximum cyclic 4-cycle packings of the complete multipartite graph
- Cyclic even cycle systems of the complete graph
- Extended Skolem-type difference sets
- Cyclic cycle systems of the complete multipartite graph
- Difference systems of sets and cyclotomy
- Mutually orthogonal cycle systems
- Extended near Skolem sequences Part I
- Primitive cycle decompositions of Kn and Kn−I
- Cyclic Hamiltonian cycle systems of the complete graph minus a 1-factor
- Computing 2-cocyeles for central extensions and relative difference sets
- Some constructions for cyclic perfect cycle systems
- A complete solution to the existence problem for 1-rotationalk-cycle systems ofKv
- A note on cyclic \(m\)-cycle systems of \(K_{r(m)}\)
- Langford-type difference sets for cycle systems
- Globally simple Heffter arrays and orthogonal cyclic cycle decompositions
- A note on conservative galaxies, Skolem systems, cyclic cycle decompositions, and Heffter arrays
- Heffter spaces
- Cyclic block designs with block size 3 from Skolem-type sequences
- Signed Langford sequences and directed cyclic cycle systems
- A survey of Heffter arrays
- Directed cyclic Hamiltonian cycle systems of the complete symmetric digraph
- On cyclic decompositions of the complete graph into the 2-regular graphs
- Cyclic Hamiltonian cycle systems of the complete graph.
- An asymptotic solution to the cycle decomposition problem for complete graphs
- On the cyclic decomposition of complete graphs into almost-bipartite graphs
- Rotational k‐cycle systems of order v < 3k; another proof of the existence of odd cycle systems
This page was built for publication: Skolem-type difference sets for cycle systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1422122)
