  In this paper, we prove that almost resolvable $k$-cycle systems (briefly
$k$-ARCS) of $(K_u \times K_g)(\lambda)$ exists for all $k \equiv 0(mod \ 4) $
with few possible exceptions, where $\times$ represents tensor product of
graphs.

Combinatorics