The Hamilton-Waterloo problem for triangle-factors and heptagon-factors

DOI10.1007/s00373-015-1570-1zbMath1331.05180arXiv1504.05293OpenAlexW2091862442MaRDI QIDQ5964990

Hung-Lin Fu, Hongchuan Lei

Publication date: 2 March 2016

Published in: Graphs and Combinatorics (Search for Journal in Brave)

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

zbMATH Keywords

2-factorizationcycle decompositionheptagon-factortriangle-factor

Mathematics Subject Classification ID

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, Completing the spectrum of almost resolvable cycle systems with odd cycle length, Further results on almost resolvable cycle systems and the Hamilton–Waterloo problem

Cites Work

• Unnamed Item
• The Hamilton-Waterloo problem for two even cycles factors
• The existence of \(C_ k\)-factorizations of \(K_{2n}-F\)
• On the Hamilton-Waterloo problem
• The Oberwolfach problem and factors of uniform odd length cycles
• The equipartite Oberwolfach problem with uniform tables
• The Hamilton-Waterloo problem: the case of Hamilton cycles and triangle-factors
• The Hamilton-Waterloo problem for Hamilton cycles and C4k-factors
• The Hamilton-Waterloo problem for Hamilton cycles and triangle-factors
• On bipartite 2-factorizations of kn − I and the Oberwolfach problem
• The Hamilton-Waterloo problem for cycle sizes 3 and 4
• The Hamilton-Waterloo problem: The case of triangle-factors and one Hamilton cycle
• Some observations on the oberwolfach problem
• On the Hamilton‐Waterloo Problem for Bipartite 2‐Factors