The $C_6$ case
Update: $C_6$ is also possible. We use the following six primitives, each implementing a Hamiltonian path in a $(2 \times 2 \times 3)$ box (big dot indicates entrance). Arranging nine of them suitably, we can fill a $(6 \times 6 \times 3)$ box; this is the top half of our solution. The bottom half is its mirror image.