Resolvable path designs
From MaRDI portal
Publication:1070250
DOI10.1016/0097-3165(85)90033-0zbMath0584.05056OpenAlexW2094822380MaRDI QIDQ1070250
Publication date: 1985
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(85)90033-0
Other designs, configurations (05B30) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph theory (05C99)
Related Items
On the chromatic index of path decompositions, On the existence of uniformly resolvable decompositions of \(K_v\) and \(K_v-I\) into paths and kites, Uniformly resolvable decompositions of \(K_v\) into \(P_3\) and \(K_3\) graphs, Block colourings of star systems, Scheduling to reduce close contacts: resolvable grid graph decomposition and packing, Unnamed Item, P\({}_ 3\)-factorization of complete multipartite graphs, Existence of resolvable path designs, On resolvable mixed path designs, Resolvable tree designs, Optical grooming with grooming ratio eight, Sub-Latin squares and incomplete orthogonal arrays, Uniformly resolvable decompositions of \(K_v\) into paths on two, three and four vertices, \(G\)-designs and related designs, Orthogonal starters in finite abelian groups, \(P_3\)-factorization of complete multipartite graphs, Path factorizations of complete multipartite graphs, On path factorizations of complete multipartite graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Further results concerning the existence of handcuffed designs
- Decomposition of a complete multigraph into simple paths: nonbalanced handcuffed designs
- On the construction of handcuffed designs
- Graph decompositions, handcuffed prisoners and balanced p-designs
- On resolvable designs
- Handcuffed designs
- Handcuffed designs
