Decomposition of a complete multigraph into simple paths: nonbalanced handcuffed designs
From MaRDI portal
Cites work
- Further results concerning the existence of handcuffed designs
- Graph decompositions, handcuffed prisoners and balanced p-designs
- Handcuffed designs
- Handcuffed designs
- scientific article; zbMATH DE number 3758364 (Why is no real title available?)
- scientific article; zbMATH DE number 3517174 (Why is no real title available?)
- On the construction of handcuffed designs
Cited in
(61)- 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 \)
- Note on the decomposition of \(\lambda K_{m,n}\) (\(\lambda K^*_{m,n}\)) into paths
- Resolvable path designs
- Nesting directed cycle systems of even length
- Resolvable tree designs
- The complete graph \(t\)-packings and \(t\)-coverings
- On colored designs. I
- On arcs in path designs of block size four
- Amalgamations of connected \(k\)-factorizations.
- 2p-cycle decompositions of some regular graphs and digraphs
- Hamilton path decompositions of complete multipartite graphs
- Minimal path decomposition of complete bipartite graphs
- Existence of a \(P_{2 k + 1}\)-decomposition in the Kneser graph \(K G_{t, 2}\)
- \(G\)-designs and related designs
- Cycle decompositions of K_n and K_n-I
- Multidecompositions of the balanced complete bipartite graph into paths and stars
- Decomposition of complete graphs into arbitrary trees
- Decompositions of some classes of dense graphs into cycles of lengths 4 and 8
- Decomposition of complete equipartite graphs into paths and cycles of length 2p
- Multicolor Turán numbers
- Decompositions of complete bipartite graphs and complete graphs into paths, stars, and cycles with four edges each
- Packing plane spanning graphs with short edges in complete geometric graphs
- Decomposition of the Kneser graph into paths of length four
- Decomposition of complete multigraphs into crown graphs
- Embedding balanced \(P_{3}\)-designs into (balanced) \(P_{4}\)-designs
- Minimum embedding of \(P_{3}\)-designs into \(\mathrm{TS}(v,\lambda )\)
- Embedding path designs into kite systems
- On the embedding of partial three path designs
- 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
- A survey on the existence ofG-Designs
- Embedding an edge-colored \(K(a^{(p)};\lambda,\mu)\) into a Hamiltonian decomposition of \(K(a^{(p+r)};\lambda,\mu)\)
- Maximum embedding of a E₂(v-w,4,1) into a P(v,4,)
- Closed trail decompositions of complete equipartite graphs
- Decomposition of complete bipartite graphs into paths and cycles
- On the existence of k-sun systems
- 2-regular equicolourings for \(\mathbf P_4\)-designs
- Decompositions of some classes of regular graphs and digraphs into cycles of length 4p
- 6-cycle decompositions of complete 3-uniform hypergraphs
- Decomposition of product graphs into sunlet graphs of order eight
- \(K_n( \lambda )\) is fully \(\{P_5,C_6\}\)-decomposable
- Decomposition of cartesian product of complete graphs into sunlet graphs of order eight
- Decomposition of product graphs into paths and cycles of length four
- Decomposition of the line graph of the complete graph into stars
- Balanced and strongly balanced \(P_k\)-designs
- Colourings of path systems
- Decomposition of complete graphs into paths and stars with different number of edges
- Transitive path decompositions of Cartesian products of complete graphs
- Decompositions of the wreath product of certain directed graphs into directed Hamiltonian cycles
- On arcs in path designs of block size 3
- Decomposition of -fold complete equipartite graphs into connected unicyclic bipartite graphs with eight edges
- Ovals in handcuffed designs of order v and block size 3
- On decompositions of the Johnson graph
- A note on P_k-decomposition of the Kneser graph
- Additive combinatorial designs
- Decomposition of complete multigraphs into stars and cycles
- Existence of resolvable path designs
- Path and cycle decompositions of complete equipartite graphs: 3 and 5 parts
- Packing paths in complete graphs
- Decomposition of complete graphs into paths and stars
This page was built for publication: Decomposition of a complete multigraph into simple paths: nonbalanced handcuffed designs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1838972)
