2017
DOI: 10.1002/jcd.21561
|View full text |Cite
|
Sign up to set email alerts
|

The Hamilton-Waterloo Problem for C3-Factors and Cn-Factors

Abstract: The Hamilton-Waterloo problem asks for a 2-factorization of K v (for v odd) or K v minus a 1-factor (for v even) into C m -factors and C n -factors. We completely solve the Hamilton-Waterloo problem in the case of C 3 -factors and C n -factors for n = 4, 5, 7.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
5

Citation Types

0
28
0

Year Published

2017
2017
2023
2023

Publication Types

Select...
5
1

Relationship

2
4

Authors

Journals

citations
Cited by 18 publications
(30 citation statements)
references
References 25 publications
(66 reference statements)
0
28
0
Order By: Relevance
“…Much of the literature on the Hamilton–Waterloo problem seeks to solve the problem for specific cycle lengths M and N . The case (M,N)=(3,4) was mostly solved in , with the remaining exceptions solved in . The cases (M,N){(3,5),(3,15),(5,15)} are solved in , except that left open HWP (v;3,5;α,1) for v>15.…”
Section: Introductionmentioning
confidence: 99%
See 1 more Smart Citation
“…Much of the literature on the Hamilton–Waterloo problem seeks to solve the problem for specific cycle lengths M and N . The case (M,N)=(3,4) was mostly solved in , with the remaining exceptions solved in . The cases (M,N){(3,5),(3,15),(5,15)} are solved in , except that left open HWP (v;3,5;α,1) for v>15.…”
Section: Introductionmentioning
confidence: 99%
“…The cases (M,N){(3,5),(3,15),(5,15)} are solved in , except that left open HWP (v;3,5;α,1) for v>15. This case was recently solved in . For (M,N)=(3,7), a near‐complete solution was given in , with the remaining exceptions solved in .…”
Section: Introductionmentioning
confidence: 99%
“…The Hamilton-Waterloo problem is the problem of determining whether K v (for v odd) or K v minus a 1-factor (for v even) has a 2-factorization in which there are exactly α C m -factors and β C n -factors. The authors [24] generalize this problem to an r-regular graph H, and use HW(H; m, n; α, β) to denote a 2-factorization of H (for r even) or H minus a 1-factor (for r odd) in which there are exactly α C m -factors and β C n -factors. Denote by HWP(H; m, n) the set of (α, β) for which an HW(H; m, n; α, β) exists.…”
Section: Introductionmentioning
confidence: 99%
“…Many authors have considered the Hamilton-Waterloo problem for small values of m and n. A complete solution for the existence of an HW(v; 3, n; α, β) in the cases n ∈ {4, 5, 7} is given in [1,7,14,21,24]. For the case (m, n) ∈ {(3, 15), (5,15), (4,6), (4,8), (4,16), (8,16)}, see [1].…”
Section: Introductionmentioning
confidence: 99%
See 1 more Smart Citation