On \(\lambda\)-fold equipartite Oberwolfach problem with uniform table sizes

DOI10.1007/s00026-003-0188-9zbMath1054.05016OpenAlexW2130401402MaRDI QIDQ1430524

Don R. Lick, Jiuqiang Liu

Publication date: 27 May 2004

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

Full work available at URL: https://doi.org/10.1007/s00026-003-0188-9

zbMATH Keywords

Hamiltonian decompositioncycle framecycle factorizationresolvable cycle design

Mathematics Subject Classification ID

Combinatorial aspects of block designs (05B05) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items

A cyclic solution for an infinite class of Hamilton-Waterloo problems ⋮ Note on three table Oberwolfach problem ⋮ Resolvable cycle decompositions of complete multigraphs and complete equipartite multigraphs via layering and detachment ⋮ A complete solution to the infinite Oberwolfach problem ⋮ Further results on almost resolvable cycle systems and the Hamilton–Waterloo problem ⋮ Doubly resolvable 4-cycle systems of \(2K_v\) ⋮ On the Hamilton‐Waterloo Problem for Bipartite 2‐Factors ⋮ Cyclic uniform 2-factorizations of the complete multipartite graph ⋮ Uniformly resolvable decompositions of \(K_v\) into paths on two, three and four vertices ⋮ Cycle frames and the Oberwolfach problem ⋮ Unnamed Item