The Hamilton-Waterloo problem with even cycle lengths
From MaRDI portal
Publication:2319702
DOI10.1016/j.disc.2019.04.013zbMath1441.05178arXiv1810.02009OpenAlexW2963299192WikidataQ127864071 ScholiaQ127864071MaRDI QIDQ2319702
Peter Danziger, Tommaso Traetta, Andrea C. Burgess
Publication date: 20 August 2019
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1810.02009
Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Distance in graphs (05C12)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- A cyclic solution for an infinite class of Hamilton-Waterloo problems
- Infinitely many cyclic solutions to the Hamilton-Waterloo problem with odd length cycles
- A complete solution to the two-table Oberwolfach problems
- The Hamilton-Waterloo problem with \(C_4\) and \(C_m\) factors
- 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\)
- On the Hamilton-Waterloo problem with cycle lengths of distinct parities
- 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
- On factorisations of complete graphs into circulant graphs and the Oberwolfach problem
- 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
- Asymptotic Existence of Resolvable Graph Designs
- The Hamilton-Waterloo problem for cycle sizes 3 and 4
- The Hamilton-Waterloo Problem for C3-Factors and Cn-Factors
- A Generalization of the Hamilton–Waterloo Problem on Complete Equipartite Graphs
- Further results on almost resolvable cycle systems and the Hamilton–Waterloo problem
- On the Hamilton–Waterloo problem with odd cycle lengths
- On the Hamilton‐Waterloo Problem for Bipartite 2‐Factors
- On the Hamilton–Waterloo Problem with Odd Orders
This page was built for publication: The Hamilton-Waterloo problem with even cycle lengths