Decompositions of graphs into cycles with chords

We show that if G is a graph on at least 3r+4s vertices with minimum degree at least 2r+3s, then G contains r+s vertex disjoint cycles, where each of s of these cycles either contain two chords, or are of order 4 and contain one chord.