Decomposition of a complete multigraph into simple paths: nonbalanced handcuffed designs
From MaRDI portal
Publication:1838972
DOI10.1016/0097-3165(83)90040-7zbMath0511.05024OpenAlexW1983162902MaRDI QIDQ1838972
Publication date: 1983
Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0097-3165(83)90040-7
Paths and cycles (05C38) Other designs, configurations (05B30) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Related Items (52)
On the embedding of partial three path designs ⋮ Decomposition of cartesian product of complete graphs into sunlet graphs of order eight ⋮ Decompositions of complete graphs into bipartite 2-regular subgraphs ⋮ Constructing the spectrum of packings and coverings for the complete graph with stars with up to five edges ⋮ \(2p\)-cycle decompositions of some regular graphs and digraphs ⋮ Multicolor Turán numbers ⋮ Decomposition of complete multigraphs into crown graphs ⋮ On colored designs. I ⋮ Embedding an edge-colored \(K(a^{(p)};\lambda,\mu)\) into a Hamiltonian decomposition of \(K(a^{(p+r)};\lambda,\mu)\) ⋮ On arcs in path designs of block size four ⋮ Unnamed Item ⋮ Decomposition of complete bipartite graphs into paths and cycles ⋮ Decomposition of complete multigraphs into stars and cycles ⋮ Amalgamations of connected \(k\)-factorizations. ⋮ Unnamed Item ⋮ Unnamed Item ⋮ On the existence of \(k\)-sun systems ⋮ Multidecompositions of the balanced complete bipartite graph into paths and stars ⋮ 2-regular equicolourings for \(\mathbf P_4\)-designs ⋮ A survey on the existence ofG-Designs ⋮ Existence of resolvable path designs ⋮ Hamilton path decompositions of complete multipartite graphs ⋮ Balanced and strongly balanced \(P_k\)-designs ⋮ Decompositions of complete bipartite graphs and complete graphs into paths, stars, and cycles with four edges each ⋮ Minimal path decomposition of complete bipartite graphs ⋮ Embedding balanced \(P_{3}\)-designs into (balanced) \(P_{4}\)-designs ⋮ Minimum embedding of \(P_{3}\)-designs into \(\mathrm{TS}(v,\lambda )\) ⋮ Maximum embedding of aE2(v − w, 4, 1) into aP(v, 4,λ) ⋮ Nesting directed cycle systems of even length ⋮ On arcs in path designs of block size 3 ⋮ Existence of a \(P_{2 k + 1}\)-decomposition in the Kneser graph \(K G_{t, 2}\) ⋮ Ovals in handcuffed designs of order \(v\) and block size 3 ⋮ Resolvable tree designs ⋮ Path and cycle decompositions of complete equipartite graphs: 3 and 5 parts ⋮ Closed trail decompositions of complete equipartite graphs ⋮ Packing paths in complete graphs ⋮ Decomposition of complete graphs into paths and stars ⋮ Unnamed Item ⋮ Decomposition of product graphs into paths and cycles of length four ⋮ Decomposition of complete graphs into arbitrary trees ⋮ Decompositions of some classes of dense graphs into cycles of lengths 4 and 8 ⋮ \(G\)-designs and related designs ⋮ Path and cycle decompositions of complete equipartite graphs: Four parts ⋮ Minimum embedding of a \(P_{4}\)-design into a balanced incomplete block design of index \(\lambda \) ⋮ Embedding path designs into kite systems ⋮ Packing plane spanning graphs with short edges in complete geometric graphs ⋮ Decomposition of complete equipartite graphs into paths and cycles of length \(2p\) ⋮ Cycle decompositions of \(K_n\) and \(K_n-I\) ⋮ Decomposition of the Kneser graph into paths of length four ⋮ The complete graph \(t\)-packings and \(t\)-coverings ⋮ Note on the decomposition of \(\lambda K_{m,n}\) (\(\lambda K^*_{m,n}\)) into paths ⋮ Resolvable path designs
Cites Work
This page was built for publication: Decomposition of a complete multigraph into simple paths: nonbalanced handcuffed designs
