Exact coverings of 2-paths by 4-cycles

DOI10.1016/0097-3165(87)90046-XzbMath0675.05044MaRDI QIDQ1121909

Katherine Heinrich, Gillian M. Nonay

Publication date: 1987

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

zbMATH Keywords

pathscyclesexact covering

Mathematics Subject Classification ID

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

Related Items (17)

Embedding coverings of 2-paths with 3-paths ⋮ Covering 2-paths uniformly ⋮ Uniform coverings of 2-paths with 4-cycles ⋮ Unnamed Item ⋮ Common multiples of complete graphs and a 4-cycle ⋮ Dudeney's round table problem ⋮ Resolvable coverings of 2-paths by 4-cycles ⋮ Exact coverings of 2-paths by Hamilton cycles ⋮ Decomposition of \(K_{m, n}\) into 4-cycles and \(2t\)-cycles ⋮ A solution of Dudeney's round table problem for an even number of people ⋮ Cycle decompositions of the line graph of \(K_ n\) ⋮ Unnamed Item ⋮ Multidecompositions of line graphs of complete graphs ⋮ A \(C_5\)-decomposition of the \(\lambda\)-fold line graph of the complete graph ⋮ Decomposition of \(K_{m,n}\) into short cycles ⋮ Uniform coverings of 2-paths with 5-paths in the complete graph ⋮ Decompositions of line graphs of complete graphs into paths and cycles

Cites Work

• On three-designs of small order
• Concerning the number of mutually orthogonal latin squares
• On Quadruple Systems
• On Some Tactical Configurations
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

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