Resolvable coverings of 2-paths by 4-cycles

DOI10.1016/0097-3165(92)90010-RzbMath0754.05025MaRDI QIDQ1193579

Gisaku Nakamura, Midori Kobayashi

Publication date: 27 September 1992

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

zbMATH Keywords

4-cycles\(C(n,4,1)\) design2-pathsresolvable coverings

Mathematics Subject Classification ID

Paths and cycles (05C38) Other designs, configurations (05B30) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (3)

Covering 2-paths uniformly ⋮ Uniform coverings of 2-paths with 4-cycles ⋮ A solution of Dudeney's round table problem for an even number of people

Cites Work

• Exact coverings of 2-paths by 4-cycles
• Exact coverings of 2-paths by Hamilton cycles

This page was built for publication: Resolvable coverings of 2-paths by 4-cycles