Published January 1, 2016
| Version v1
Journal article
Open
The Hamilton-Waterloo Problem with C-4 and C-m factors
Creators
- 1. Istanbul Univ, Dept Engn Sci, Fac Engn, TR-34320 Avcilar, Turkey
- 2. Gebze Tech Univ, Dept Math, TR-41400 Gebze, Turkey
Description
The Hamilton Waterloo problem with uniform cycle sizes asks for a 2-factorization of the complete graph K-v (for odd v) or K-v minus a 1-factor (for even v) where r of the factors consist of n-cycles and s of the factors consist of m-cycles with r + s = [v-1/2]. In this paper, the Hamilton Waterloo Problem with 4-cycle and m-cycle factors for odd m >= 3 is studied and all possible solutions with a few possible exceptions are determined. (C) 2015 Elsevier B.V. All rights reserved.
Files
bib-a83af710-cb89-4d27-be2e-2f056866aa6c.txt
Files
(125 Bytes)
| Name | Size | Download all |
|---|---|---|
|
md5:55fe69128223db607ccf4d727e2ddb44
|
125 Bytes | Preview Download |