On a generalization of the Oberwolfach problem

DOI10.1016/j.jcta.2004.02.003zbMath1042.05080MaRDI QIDQ1826944

Charles Vanden Eynden, Saad I. El-Zanati, Abdollah Khodkar, Nicholas J. Cavenagh

Publication date: 6 August 2004

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

Full work available at URL: https://doi.org/10.1016/j.jcta.2004.02.003

zbMATH Keywords

Oberwolfach problem; 2-Factorization

Mathematics Subject Classification ID

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

Related Items

On the Hamilton‐Waterloo Problem for Bipartite 2‐Factors, On the generalized Oberwolfach problem, Uniformly resolvable cycle decompositions with four different factors, Cyclic uniform 2-factorizations of the complete multipartite graph, Pancomponented 2-factorizations of complete graphs, Factorizations of complete graphs into cycles and 1-factors

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Hamiltonian decomposition of Cayley graphs of degree 4
• On a variation of the Oberwolfach problem
• The existence of \(C_ k\)-factorizations of \(K_{2n}-F\)
• On the Hamilton-Waterloo problem
• Two-factorizations of small complete graphs
• The Oberwolfach problem and factors of uniform odd length cycles
• The equipartite Oberwolfach problem with uniform tables
• Some observations on the oberwolfach problem
• A generalization of the Oberwolfach problem
• $F$-Square and Orthogonal $F$-Squares Design: A Generalization of Latin Square and Orthogonal Latin Squares Design