On cyclic decompositions of the complete graph into the 2-regular graphs

DOI10.1007/BF02832315MaRDI QIDQ2454980zbMATH OpenFDO

Authors Zhihe Liang

Publication date 22 October 2007

Published in Journal of Applied Mathematics and Computing (Search for Journal in Brave)

Mathematics Subject Classification ID

Other designs, configurations (05B30) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• Cyclically decomposing the complete graph into 2-regular graphs
• scientific article; zbMATH DE number 1885943
• On cyclic decompositions of \(K_{n-1,n-1}+I\) into a 2-regular bipartite graph with at most 2 components
• Cyclically decomposing the complete graph into cycles
• On cyclic decompositions of \(K_{n+1,n+1}-I\) into a 2-regular graph with at most 2 components

Cites work

• scientific article; zbMATH DE number 3238443 (Why is no real title available?)
• scientific article; zbMATH DE number 3031875 (Why is no real title available?)
• Cycle decompositions of K_n and K_n-I
• Cycle decompositions. III: Complete graphs and fixed length cycles.
• 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 cyclic \(k\)-cycle systems of the complete graph
• Minimal quadratic residue cyclic codes of length \(2^n\)
• On the cyclic decomposition of complete graphs into almost-bipartite graphs
• Skolem-type difference sets for cycle systems
• Weak embedding of planar graphs

Cited in

(10)

• scientific article; zbMATH DE number 1885943 (Why is no real title available?)
• scientific article; zbMATH DE number 5174848 (Why is no real title available?)
• scientific article; zbMATH DE number 5059992 (Why is no real title available?)
• scientific article; zbMATH DE number 4047737 (Why is no real title available?)
• A near cyclic \((m_1, m_2, \ldots, m_r)\)-cycle system of complete multigraph
• On cyclic \(G\)-designs where \(G\) is the one-point union of two cycles
• On cyclic \(G\)-designs where \(G\) is the one-point union of two cycles
• On the existence of a cyclic near-resolvable \((6n+4)\)-cycle system of \(2 K_{12n+9}\)
• Cyclically decomposing the complete graph into 2-regular graphs
• On path decompositions of \(2 k\)-regular graphs

This page was built for publication: On cyclic decompositions of the complete graph into the 2-regular graphs

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