A graph G = (V, E) is two-disjoint-cycle-cover [r1, r2]-pancyclic if for any integer l satisfying r1 ≤ l ≤ r2, there exist two vertex-disjoint cycles C1 and C2 in G such that the lengths of C1 and C2 are l and |V|− l, respectively, where |V| denotes the total number of vertices in G. On the basis of this definition, we further propose Ore-type conditions for graphs to be two-disjoint-cycle-cover vertex/edge [r1, r2]-pancyclic. In addition, we study cycle embedding in the n-dimensional locally twisted cube LTQn under the consideration of two-disjoint-cycle-cover vertex/edge pancyclicity.
