
doi: 10.1002/jcd.20196
AbstractThe Hamilton—Waterloo problem is to determine the existence of a 2‐factorization of K2n+1 in which r of the 2‐factors are isomorphic to a given 2‐factor R and s of the 2‐factors are isomorphic to a given 2‐factor S, with r + s=n. In this article we consider the case when R is a triangle‐factor, S is a Hamilton cycle and s = 1. We solve the problem completely except for 14 possible exceptions. This solves a major open case from the 2004 article of Horak et al. © 2008 Wiley Periodicals, Inc. J Combin Designs 17: 160–176, 2009
Eulerian and Hamiltonian graphs, Oberwolfach problem, resolvable design, Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.), triple system, Hamilton-Waterlo problem, Paths and cycles
Eulerian and Hamiltonian graphs, Oberwolfach problem, resolvable design, Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.), triple system, Hamilton-Waterlo problem, Paths and cycles
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 21 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Top 10% | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
