On the Hamilton-Waterloo problem with cycle lengths of distinct parities
DOI10.1016/J.DISC.2018.02.020zbMath1384.05131arXiv1801.07638OpenAlexW2963166896WikidataQ130080998 ScholiaQ130080998MaRDI QIDQ1744749
Tommaso Traetta, Peter Danziger, Andrea C. Burgess
Publication date: 19 April 2018
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1801.07638
cycle systemsHamilton-Waterloo problem2-factorizationsgeneralized Oberwolfach problemresolvable cycle decompositions
Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Distance in graphs (05C12)
Related Items (4)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A complete solution to the two-table Oberwolfach problems
- Hamilton decompositions of 6-regular Cayley graphs on even abelian groups with involution-free connections sets
- The Hamilton-Waterloo problem with \(C_4\) and \(C_m\) factors
- Graph products and new solutions to Oberwolfach problems
- Complete solutions to the Oberwolfach problem for an infinite set of orders
- Hamiltonian decomposition of Cayley graphs of degree 4
- The existence of \(C_ k\)-factorizations of \(K_{2n}-F\)
- The Oberwolfach problem and factors of uniform odd length cycles
- The equipartite Oberwolfach problem with uniform tables
- A note on the Hamilton-Waterloo problem with \(C_8\)-factors and \(C_m\)-factors
- The Hamilton-Waterloo problem with 4-cycles and a single factor of \(n\)-cycles
- On the Hamilton-Waterloo Problem with triangle factors and $C_{3x}$-factors
- The Hamilton-Waterloo problem for Hamilton cycles and triangle-factors
- On bipartite 2-factorizations of kn − I and the Oberwolfach problem
- Octahedral, dicyclic and special linear solutions of some Hamilton-Waterloo problems
- The Hamilton-Waterloo problem for cycle sizes 3 and 4
- Some observations on the oberwolfach problem
- Extended skolem sequences
- The Hamilton-Waterloo Problem for C3-Factors and Cn-Factors
- A Generalization of the Hamilton–Waterloo Problem on Complete Equipartite Graphs
- On the Hamilton–Waterloo problem with odd cycle lengths
- On the Hamilton‐Waterloo Problem for Bipartite 2‐Factors
- Bipartite 2‐Factorizations of Complete Multipartite Graphs
- On the Hamilton–Waterloo Problem with Odd Orders
This page was built for publication: On the Hamilton-Waterloo problem with cycle lengths of distinct parities