Infinitely many cyclic solutions to the Hamilton-Waterloo problem with odd length cycles
From MaRDI portal
Publication:297926
DOI10.1016/j.disc.2016.03.026zbMath1338.05138arXiv1501.06999OpenAlexW1588205065MaRDI QIDQ297926
Tommaso Traetta, Francesca Merola
Publication date: 20 June 2016
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1501.06999
Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Related Items
A note on the Hamilton-Waterloo problem with \(C_8\)-factors and \(C_m\)-factors, Cyclic cycle systems of the complete multipartite graph, Completing the spectrum of almost resolvable cycle systems with odd cycle length, Further results on almost resolvable cycle systems and the Hamilton–Waterloo problem, On the generalized Oberwolfach problem, The Hamilton-Waterloo problem with even cycle lengths
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A cyclic solution for an infinite class of Hamilton-Waterloo problems
- 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
- On a variation of the Oberwolfach problem
- On the Hamilton-Waterloo problem
- A dynamic survey of graph labeling
- Cyclic Hamiltonian cycle systems of the complete graph.
- Two-factorizations of small complete graphs
- The Hamilton-Waterloo problem: the case of Hamilton cycles and triangle-factors
- The structure of 2-pyramidal 2-factorizations
- Cyclic Hamiltonian cycle systems of the complete graph minus a 1-factor
- On sharply vertex transitive 2-factorizations of the complete graph
- Some constructions for cyclic perfect cycle systems
- The Hamilton-Waterloo problem with 4-cycles and a single factor of \(n\)-cycles
- On bipartite 2-factorizations of kn − I and the Oberwolfach problem
- Octahedral, dicyclic and special linear solutions of some Hamilton-Waterloo problems
- On 2-factorizations of the complete graph: From thek-pyramidal to the universal property
- The Hamilton-Waterloo problem for cycle sizes 3 and 4
- The Hamilton-Waterloo problem: The case of triangle-factors and one Hamilton cycle
- The Hamilton-Waterloo Problem for C3-Factors and Cn-Factors
- On the Hamilton–Waterloo Problem with Odd Orders
- 1‐rotational k‐factorizations of the complete graph and new solutions to the Oberwolfach problem