Further results on almost resolvable cycle systems and the Hamilton–Waterloo problem

DOI10.1002/jcd.21571zbMath1391.05212arXiv1605.00818OpenAlexW3100836444MaRDI QIDQ4642156

No author found.

Publication date: 22 May 2018

Published in: Journal of Combinatorial Designs (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1605.00818

zbMATH Keywords

2-factorizationHamilton-Waterloo problemalmost resolvable cycle system

Mathematics Subject Classification ID

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

Related Items (1)

The Hamilton-Waterloo problem with even cycle lengths

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A cyclic solution for an infinite class of Hamilton-Waterloo problems
• Infinitely many cyclic solutions to the Hamilton-Waterloo problem with odd length cycles
• The Hamilton-Waterloo problem with \(C_4\) and \(C_m\) factors
• On the existence of cycle frames and almost resolvable cycle systems
• The generalized almost resolvable cycle system problem
• Hanani triple systems
• More results on cycle frames and almost resolvable cycle systems
• Resolvable group divisible designs with block size 3
• Near 2-factorizations of \(2K_ n:\) Cycles of even length
• Frames for Kirkman triple systems
• The solution of the bipartite analogue of the Oberwolfach problem
• On the Hamilton-Waterloo problem
• On \(\lambda\)-fold equipartite Oberwolfach problem with uniform table sizes
• On the Hamilton-Waterloo problem with cycle lengths of distinct parities
• The Oberwolfach problem and factors of uniform odd length cycles
• Almost resolvable decompositions of \(2K_ n\) into cycles of odd length
• The equipartite Oberwolfach problem with uniform tables
• The Hamilton-Waterloo problem: the case of Hamilton cycles and triangle-factors
• Fair holey Hamiltonian decompositions of complete multipartite graphs and long cycle frames
• On sharply vertex transitive 2-factorizations of the complete graph
• The Hamilton-Waterloo problem with 4-cycles and a single factor of \(n\)-cycles
• Cycle decompositions III: Complete graphs and fixed length cycles
• On the Hamilton-Waterloo Problem with triangle factors and $C_{3x}$-factors
• Cycle Frames of Complete Multipartite Multigraphs - III
• The Hamilton-Waterloo problem for Hamilton cycles and C4k-factors
• The Hamilton-Waterloo problem for Hamilton cycles and triangle-factors
• Octahedral, dicyclic and special linear solutions of some Hamilton-Waterloo problems
• Almost resolvable cycle systems-an analogue of Hanani triple systems
• The Hamilton-Waterloo problem for cycle sizes 3 and 4
• The Hamilton-Waterloo problem: The case of triangle-factors and one Hamilton cycle
• The Hamilton-Waterloo Problem for C3-Factors and Cn-Factors
• Two new direct product‐type constructions for resolvable group‐divisible designs
• On the Hamilton‐Waterloo Problem for Bipartite 2‐Factors
• On the Hamilton–Waterloo Problem with Odd Orders
• The Hamilton-Waterloo problem for triangle-factors and heptagon-factors

This page was built for publication: Further results on almost resolvable cycle systems and the Hamilton–Waterloo problem