Existence of resolvable path designs
From MaRDI portal
Publication:923105
DOI10.1016/S0195-6698(13)80120-5zbMath0712.05045MaRDI QIDQ923105
Katherine Heinrich, Jean-Claude Bermond, Min-Li Yu
Publication date: 1990
Published in: European Journal of Combinatorics (Search for Journal in Brave)
05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)
Related Items
On tree factorizations of Kn, On resolvable mixed path designs, Nesting directed cycle systems of even length, Resolvable tree designs, Path factorizations of complete multipartite graphs, On path factorizations of complete multipartite graphs, \(G\)-designs and related designs, On the chromatic index of path decompositions, A survey on the existence ofG-Designs, Almost resolvable Pk‐decompositions of complete graphs
Cites Work