On the cyclic decompositions of the complete graph into polygons with odd number of edges
From MaRDI portal
Publication:5530473
DOI10.21136/cpm.1966.117555zbMath0151.33501OpenAlexW3047665431WikidataQ114046924 ScholiaQ114046924MaRDI QIDQ5530473
Publication date: 1966
Full work available at URL: https://doi.org/10.21136/cpm.1966.117555
Related Items (28)
On the cyclic decomposition of complete graphs into almost-bipartite graphs ⋮ Maximum packings with odd cycles ⋮ Cyclic even cycle systems of the complete graph ⋮ Nesting and almost resolvability of pentagon systems ⋮ A note on cyclic \(m\)-cycle systems of \(K_{r(m)}\) ⋮ Embeddings of \(m\)-cycle systems and incomplete \(m\)-cycle systems: \(m\leq 14\) ⋮ Difference families in \(\text{Z}_{2d+1}\oplus \text{Z}_{2d+1}\) and infinite translation designs in \(\text{Z} \oplus \text{Z}\) ⋮ Unnamed Item ⋮ Cyclic Hamiltonian cycle systems of the complete graph minus a 1-factor ⋮ A complete solution to the infinite Oberwolfach problem ⋮ Difference systems, graph designs, and coloring problems ⋮ Cyclic Hamiltonian cycle systems of the complete graph. ⋮ Maximum cyclic 4-cycle packings of the complete multipartite graph ⋮ A complete solution to the existence problem for 1-rotationalk-cycle systems ofKv ⋮ Cyclic Hamiltonian cycle systems of the \(\lambda \)-fold complete and cocktail party graphs ⋮ Edge partitions of complete multipartite graphs into equal length circuits ⋮ Decomposition of the complete directed graph into k-circuits ⋮ Decomposition of \(K_n\) into circuits of odd length ⋮ Strong difference families over arbitrary graphs ⋮ \(G\)-designs and related designs ⋮ Directed cyclic Hamiltonian cycle systems of the complete symmetric digraph ⋮ Neighbor designs and m-wheel systems ⋮ Cyclically decomposing the complete graph into cycles ⋮ On the existence of elementary Abelian cycle systems ⋮ A non-existence result on cyclic cycle-decompositions of the cocktail party graph ⋮ Some constructions for cyclic perfect cycle systems ⋮ Starter sequences and M-fold starter sequences: How can you begin? ⋮ Steiner pentagon systems
This page was built for publication: On the cyclic decompositions of the complete graph into polygons with odd number of edges
