scientific article

Publication date: 21 February 1993

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

survey partition embedding spectrum cycles Steiner triple system resolvability nestings \(m\)-cycle systems

Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Triple systems (05B07)

Related Items (54)

On the cyclic decomposition of complete graphs into almost-bipartite graphs ⋮ On the chromatic index of path decompositions ⋮ Colouring 4-cycle systems with equitably coloured blocks ⋮ Mixed partitions of sets of triples into small planes ⋮ The Doyen-Wilson theorem extended to 5-cycles ⋮ \(C_{p}\)-decompositions of some regular graphs ⋮ The spectrum for 2-perfect bowtie systems ⋮ A note on varieties of groupoids arising from \(m\)-cycle systems ⋮ Decomposing the complete graph into cycles of many lengths ⋮ Strongly 2-perfect cycle systems and their quasigroups ⋮ 2-perfect directed \(m\)-cycle systems can be equationally defined for \(m=3,4\), and \(5\) only ⋮ Constructing identities for finite quasigroups ⋮ On equationally defining extended cycle systems ⋮ Partitionable perfect cycle systems with cycle lengths 6 and 8 ⋮ Edge exchanges in Hamiltonian decompositions of Kronecker-product graphs ⋮ \(2m\)-cycle systems of \(K_{2m+1}\backslash C_m\) ⋮ Existence of SOLS with holes of type \(2^ n u^ 1\) ⋮ Optimal packing of even circuits into a \(\text{DK}_ v\) ⋮ Difference families in \(\text{Z}_{2d+1}\oplus \text{Z}_{2d+1}\) and infinite translation designs in \(\text{Z} \oplus \text{Z}\) ⋮ Decompositions of regular graphs into \(K^ c_ n \vee 2K_ 2\) ⋮ Decomposition of the complete bipartite graph with a 1-factor removed into cycles and stars ⋮ Almost resolvable maximum packings of complete graphs with 5-cycles ⋮ Amalgamations of connected \(k\)-factorizations. ⋮ Perfect 7-cycle systems ⋮ Completing partial packings of bipartite graphs ⋮ All graphs with maximum degree three whose complements have 4-cycle decompositions ⋮ Cyclic Hamiltonian cycle systems of the complete graph. ⋮ Decompositions of edge-colored complete graphs ⋮ On Hering decomposition of DK\(_n\) induced by group actions on conjugacy classes ⋮ Decompositions of complete bipartite graphs and complete graphs into paths, stars, and cycles with four edges each ⋮ Existence of frame sols of type 2ⁿu¹ ⋮ \(d\)-cube decompositions of \(K_n\setminus K_m\) ⋮ Packing cycles in complete graphs ⋮ Resolvable 4-cycle group divisible designs with two associate classes: part size even ⋮ Colouring even cycle systems ⋮ Packing 5-cycles into balanced complete \(m\)-partite graphs for odd \(m\) ⋮ Decompositions of multicrowns into cycles and stars ⋮ A partial \(m=(2k+1)\)-cycle system of order \(n\) can be embedded in an \(m\)- cycle of order \((2n+1)m\) ⋮ Tight embeddings of partial quadrilateral packings ⋮ Special issue: 2nd Shanghai conference on designs, codes and finite geometries. Shanghai Jiao Tong Univ., Shanghai, China, May 14--18, 1996 ⋮ Recent progress on the existence of perfect Mendelsohn designs ⋮ Existence of frame SOLS of type \(a^nb^1\) for odd \(n\) ⋮ Perfect dodecagon quadrangle systems ⋮ Decompositions of some regular graphs into unicyclic graphs of order five ⋮ Six-cycle systems ⋮ On the minimum number of bond-edge types and tile types: an approach by edge-colorings of graphs ⋮ The spectrum of \(\text{HSOLSSOM}(h^ n)\) where \(h\) is even ⋮ On a generalization of the Oberwolfach problem ⋮ A solution to the forest leave problem for partial 6-cycle systems ⋮ Decomposing complete tripartite graphs into cycles of lengths 3 and 4 ⋮ Cycle factorizations of cycle products ⋮ \((m,n)\)-cycle systems ⋮ Cycle decompositions of \(K_n\) and \(K_n-I\) ⋮ Decomposition of the complete bipartite multigraph into cycles and stars

This page was built for publication: