Abstract: It is proved that Win's conjecture is true for k = 3. A better conclusion is obtained. There exist two Hamilton cycles and a 1-factor which are edge-disjoint in a Ore-type-(3) graph of order 2n (n≥10). Moreover, this result is best possible for δ(G)=5.