## Abstract In this article, we consider the Hamilton‐Waterloo problem for the case of Hamilton cycles and triangle‐factors when the order of the complete graph __K__~__n__~ is even. We completely solved the problem for the case __n__≡24 (mod 36). For the cases __n__≡0 (mod 18) and __n__≡6 (mod 36)
The Hamilton–Waterloo problem for cycle sizes 3 and 4
✍ Scribed by Peter Danziger; Gaetano Quattrocchi; Brett Stevens
- Publisher
- John Wiley and Sons
- Year
- 2009
- Tongue
- English
- Weight
- 127 KB
- Volume
- 17
- Category
- Article
- ISSN
- 1063-8539
No coin nor oath required. For personal study only.
✦ Synopsis
Abstract
The Hamilton–Waterloo problem seeks a resolvable decomposition of the complete graph K~n~, or the complete graph minus a 1‐factor as appropriate, into cycles such that each resolution class contains only cycles of specified sizes. We completely solve the case in which the resolution classes are either all 3‐cycles or 4‐cycles, with a few possible exceptions when n=24 and 48. © 2009 Wiley Periodicals, Inc. J Combin Designs 17: 342–352, 2009
📜 SIMILAR VOLUMES
## Abstract The Hamilton—Waterloo problem is to determine the existence of a 2‐factorization of __K__~2__n__+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
The gas to particle synthesis route is a relatively clean and efficient manner for the production of high-quality ceramic powders. These powders can be subsequently sintered in any wanted shape. The modeling of these production systems is difficult because several mechanisms occur in parallel. From