A Generalization of the Hamilton–Waterloo Problem on Complete Equipartite Graphs
From MaRDI portal
Publication:4591508
DOI10.1002/jcd.21560zbMath1374.05179arXiv1605.01781OpenAlexW2964052122MaRDI QIDQ4591508
Adrián Pastine, Melissa S. Keranen
Publication date: 17 November 2017
Published in: Journal of Combinatorial Designs (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1605.01781
graph decompositioncomplete multipartite graphsHamilton-Waterloo problemgeneralized Oberwolfach problem
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Distance in graphs (05C12)
Related Items (7)
A note on the Hamilton-Waterloo problem with \(C_8\)-factors and \(C_m\)-factors ⋮ Resolvable cycle decompositions of complete multigraphs and complete equipartite multigraphs via layering and detachment ⋮ Completing the spectrum of almost resolvable cycle systems with odd cycle length ⋮ On the Hamilton-Waterloo problem with cycle lengths of distinct parities ⋮ On the generalized Oberwolfach problem ⋮ On the Hamilton-Waterloo problem: the case of two cycles sizes of different parity ⋮ The Hamilton-Waterloo problem with even cycle lengths
This page was built for publication: A Generalization of the Hamilton–Waterloo Problem on Complete Equipartite Graphs
