Cycle double covers containing certain circuits in cubic graphs having special structures

Our point of departure is Fleischner and Häggkvist (2014, Theorem 2). We first generalize this theorem. Then we apply it to cubic graphs whose vertex set can be decomposed into two classes, one class inducing a circuit and the other class inducing a (subdivision of a) caterpillar.