Cycle decompositions with a sharply vertex transitive automorphism group
From MaRDI portal
Publication:3594046
Recommendations
- Sharply transitive decompositions of complete graphs into generalized Petersen graphs
- Graph decompositions and symmetry
- On the existence spectrum for sharply transitive \(G\)-designs, \(G\) a \([k]\)-matching
- Odd-cycle systems with prescribed automorphism groups
- Even‐cycle systems with prescribed automorphism groups
Cited in
(21)- Graph decompositions and symmetry
- On the existence spectrum for sharply transitive \(G\)-designs, \(G\) a \([k]\)-matching
- Strong difference families over arbitrary graphs
- A non-existence result on cyclic cycle-decompositions of the cocktail party graph
- Mutually orthogonal cycle systems
- Cyclic Hamiltonian cycle systems of the \(\lambda \)-fold complete and cocktail party graphs
- Transitive large sets of disjoint decompositions and group sequencings
- Relative Heffter arrays and biembeddings
- On the existence of elementary Abelian cycle systems
- Dihedral Hamiltonian cycle systems of the cocktail party graph
- A generalization of Heffter arrays
- Sharply transitive decompositions of complete graphs into generalized Petersen graphs
- On \(\lambda\)-fold relative Heffter arrays and biembedding multigraphs on surfaces
- On the Decomposition of Vertex-Transitive Graphs into Multicycles
- Equitably 2-colourable even cycle systems
- Signed Langford sequences and directed cyclic cycle systems
- A complete solution to the infinite Oberwolfach problem
- A complete solution to the existence problem for 1-rotationalk-cycle systems ofKv
- Cyclic Hamiltonian cycle systems of the complete graph minus a 1-factor
- Octahedral, dicyclic and special linear solutions of some Hamilton-Waterloo problems
- Cyclic even cycle systems of the complete graph
This page was built for publication: Cycle decompositions with a sharply vertex transitive automorphism group
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3594046)