For an even graph G and positive integer p, q, and k, the pair (p, q) is an admissible pair if (�+�)⁢�=|�⁡(�)|. If a graph G admits a decomposition into p copies of ��+1, the path of length k, and q copies of Ck, the cycle of length k, for every admissible pair (p, q), then G has a {��+1,��}{�,�}-decomposition. In this paper, we give necessary and sufficient conditions for the existence of a {��+1,��}{�,�}-decomposition of n-dimensional hypercube graphs Qn when n is even, �≥4, and �≡0 (mod⁡�).