SOME RESULTS ON THE OBERWOLFACH PROBLEM

DOI10.1112/S0024610701002666zbMath1012.05135MaRDI QIDQ3151065

Matthew Johnson, Anthony J. W. Hilton

Publication date: 22 October 2002

Published in: Journal of the London Mathematical Society (Search for Journal in Brave)

zbMATH Keywords

1-factoredge-colouring2-factors\(r\)-cycle

Mathematics Subject Classification ID

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

Related Items (16)

On bipartite 2-factorizations of kn − I and the Oberwolfach problem ⋮ The Hamilton-Waterloo problem with 4-cycles and a single factor of \(n\)-cycles ⋮ Note on three table Oberwolfach problem ⋮ Merging Combinatorial Design and Optimization: the Oberwolfach Problem ⋮ A complete solution to the two-table Oberwolfach problems ⋮ Orthogonally Resolvable Cycle Decompositions ⋮ Resolvable cycle decompositions of complete multigraphs and complete equipartite multigraphs via layering and detachment ⋮ A constructive solution to the Oberwolfach problem with a large cycle ⋮ 2‐Starters, Graceful Labelings, and a Doubling Construction for the Oberwolfach Problem ⋮ On the Hamilton‐Waterloo Problem for Bipartite 2‐Factors ⋮ Zero-sum flows for triple systems ⋮ Resolution of the Oberwolfach problem ⋮ Complete solutions to the Oberwolfach problem for an infinite set of orders ⋮ A non-existence result on cyclic cycle-decompositions of the cocktail party graph ⋮ From graceful labellings of paths to cyclic solutions of the Oberwolfach problem ⋮ Spanning cubic graph designs

This page was built for publication: SOME RESULTS ON THE OBERWOLFACH PROBLEM