On resolvable mixed path designs

DOI10.1016/S0195-6698(13)80132-1zbMath0712.05046OpenAlexW2031459799MaRDI QIDQ923106

Min-Li Yu, Katherine Heinrich, Jean-Claude Bermond

Publication date: 1990

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0195-6698(13)80132-1

zbMATH Keywords

partitionresolvablespanning subgraph1-factorscomplete multigraph\(P_ k\)-factors

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (2)

Uniformly resolvable decompositions of \(K_v\) into \(P_3\) and \(K_3\) graphs ⋮ Nesting directed cycle systems of even length

Cites Work

• Existence of resolvable path designs
• Resolvable path designs
• Uniformly resolvable pairwise balanced designs with blocksizes two and three
• On a variation of the Oberwolfach problem
• The Oberwolfach problem and factors of uniform odd length cycles
• Some observations on the oberwolfach problem

This page was built for publication: On resolvable mixed path designs