Resolvable cycle decompositions of complete multigraphs and complete equipartite multigraphs via layering and detachment

DOI10.1002/jcd.21792arXiv1809.09305OpenAlexW3173322072MaRDI QIDQ6146193

Publication date: 5 February 2024

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

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

zbMATH Keywords

layering detachment 2-factorization Hamilton-Waterloo problem Oberwolfach problem

Mathematics Subject Classification ID

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

Cites Work

Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
A complete solution to the two-table Oberwolfach problems
Decompositions of complete multigraphs into cycles of varying lengths
More results on cycle frames and almost resolvable cycle systems
Complete solutions to the Oberwolfach problem for an infinite set of orders
The existence of $C_ k$-factorizations of $K_{2n}-F$
The spectrum of $\alpha$-resolvable block designs with block size 3
On the Oberwolfach problem for complete multigraphs
On $\lambda$-fold equipartite Oberwolfach problem with uniform table sizes
Two-factorizations of small complete graphs
On the Hamilton-Waterloo problem with cycle lengths of distinct parities
The Oberwolfach problem and factors of uniform odd length cycles
On the Oberwolfach problem for single-flip 2-factors via graceful labelings
On the Hamilton-Waterloo Problem with triangle factors and $C_{3x}$-factors
Decomposing Complete Equipartite Multigraphs into Cycles of Variable Lengths: The Amalgamation-detachment Approach
SOME RESULTS ON THE OBERWOLFACH PROBLEM
On bipartite 2-factorizations of kn − I and the Oberwolfach problem
Some observations on the oberwolfach problem
A Generalization of the Hamilton–Waterloo Problem on Complete Equipartite Graphs
On the Hamilton–Waterloo problem with odd cycle lengths
α‐Resolvable group divisible designs with block size three
Cycle decompositions V: Complete graphs into cycles of arbitrary lengths
Bipartite 2‐Factorizations of Complete Multipartite Graphs
Merging Combinatorial Design and Optimization: the Oberwolfach Problem
On the Hamilton-Waterloo problem: the case of two cycles sizes of different parity
A Complete Solution to the Existence of ‐Cycle Frames of Type
On the Hamilton–Waterloo Problem with Odd Orders

This page was built for publication: Resolvable cycle decompositions of complete multigraphs and complete equipartite multigraphs via layering and detachment