A complete solution to the existence problem for 1-rotationalk-cycle systems ofKv

DOI10.1002/JCD.20217MaRDI QIDQ3578152zbMATH OpenOpenAlexFDO

Authors Shung-Liang Wu, Marco Buratti

Publication date 13 July 2010

Published in Journal of Combinatorial Designs (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/jcd.20217

zbMATH Keywords

1-rotational cycle systemcirculant graphcycle systemcyclic cycle system

Mathematics Subject Classification ID

Other designs, configurations (05B30) Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85)

Recommendations

• Existence of 1-rotational \(k\)-cycle systems of the complete graph
• Rotational k‐cycle systems of order v < 3k; another proof of the existence of odd cycle systems
• Some results on 1-rotational Hamiltonian cycle systems
• Resolvable even‐cycle systems with a 1‐rotational automorphism
• Existence of cyclic \(k\)-cycle systems of the complete graph
• A note on the existence of cyclic and 1-rotational kite systems.
• scientific article; zbMATH DE number 4127661
• Cyclick-cycle systems of order 2kn +k: A solution of the last open cases
• 1‐rotationally resolvable 4‐cycle systems of 2K_v
• Existence of rotating-periodic solutions for nonlinear systems via upper and lower solutions

Cites work

• 1-rotational Steiner triple systems over arbitrary groups
• Cycle decompositions of complete graphs
• Cycle decompositions with a sharply vertex transitive automorphism group
• Cyclic Hamiltonian cycle systems of the complete graph.
• Cyclically decomposing the complete graph into cycles
• Cyclick-cycle systems of order 2kn +k: A solution of the last open cases
• Existence of 1-rotational \(k\)-cycle systems of the complete graph
• Existence of cyclic \(k\)-cycle systems of the complete graph
• On decomposing K_n -I into cycles of a fixed odd length
• On the construction of odd cycle systems
• On the cyclic decomposition of complete graphs into almost-bipartite graphs
• On the cyclic decompositions of the complete graph into polygons with odd number of edges
• Rotational k‐cycle systems of order v < 3k; another proof of the existence of odd cycle systems
• Skolem-type difference sets for cycle systems
• Steiner triple systems with rotational automorphisms
• The spectrum of 1-rotational Steiner triple systems over a dicyclic group

Cited in

(11)

• On the existence of elementary Abelian cycle systems
• Completing the spectrum of almost resolvable cycle systems with odd cycle length
• Existence of 1-rotational \(k\)-cycle systems of the complete graph
• 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
• Resolvable even‐cycle systems with a 1‐rotational automorphism
• Rotational k‐cycle systems of order v < 3k; another proof of the existence of odd cycle systems
• 1‐rotationally resolvable 4‐cycle systems of 2K_v
• A generalization of the problem of Mariusz Meszka
• A reduction of the spectrum problem for odd sun systems and the prime case
• Cyclic Hamiltonian cycle systems of the -fold complete and cocktail party graphs

This page was built for publication: A complete solution to the existence problem for 1-rotationalk-cycle systems ofKv

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3578152)