On cyclic decompositions of the complete graph into the 2-regular graphs
From MaRDI portal
Publication:2454980
DOI10.1007/BF02832315zbMath1124.05076MaRDI QIDQ2454980
Publication date: 22 October 2007
Published in: Journal of Applied Mathematics and Computing (Search for Journal in Brave)
Other designs, configurations (05B30) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Skolem-type difference sets for cycle systems
- Cyclic Hamiltonian cycle systems of the complete graph.
- Cyclically decomposing the complete graph into cycles
- Cycle decompositions of \(K_n\) and \(K_n-I\)
- Existence of cyclic \(k\)-cycle systems of the complete graph
- On the cyclic decomposition of complete graphs into almost-bipartite graphs
- Minimal quadratic residue cyclic codes of length \(2^n\)
- Weak embedding of planar graphs
- Cycle decompositions III: Complete graphs and fixed length cycles
- Cyclick-cycle systems of order 2kn +k: A solution of the last open cases
This page was built for publication: On cyclic decompositions of the complete graph into the 2-regular graphs