𝔖 Bobbio Scriptorium
✦   LIBER   ✦

The Hamilton–Waterloo problem: the case of Hamilton cycles and triangle-factors

✍ Scribed by Peter Horak; Roman Nedela; Alex Rosa

Book ID
108113401
Publisher
Elsevier Science
Year
2004
Tongue
English
Weight
224 KB
Volume
284
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The Hamilton—Waterloo problem: The case
The Hamilton—Waterloo problem: The case of triangle-factors and one Hamilton cycle
✍ J.H. Dinitz; Alan C.H. Ling 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 166 KB

## 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 Hamilton-Waterloo problem for Hamilt
The Hamilton-Waterloo problem for Hamilton cycles and triangle-factors
✍ Hongchuan Lei; Hao Shen 📂 Article 📅 2011 🏛 John Wiley and Sons 🌐 English ⚖ 147 KB

## 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
The Hamilton–Waterloo problem for cycle sizes 3 and 4
✍ Peter Danziger; Gaetano Quattrocchi; Brett Stevens 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 127 KB

## 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 resolu