In 1963, Corrádi and Hajnal settled a conjecture of Erdős by proving that, for all $$k \ge 1$$ k ≥ 1 , any graph G with $$|G| \ge 3k$$ | G | ≥ 3 k and minimum degree at least 2k contains k vertex-disjoint cycles. In 2008, Finkel proved that for all $$k \ge 1$$ k ≥ 1 , any graph G with $$|G| \ge 4k$$ | G | ≥ 4 k and minimum degree at least 3k contains k vertex-disjoint chorded cycles. Finkel’s result was strengthened by Chiba, Fujita, Gao, and Li in 2010, who showed, among other results, that for all $$k \ge 1$$ k ≥ 1 , any graph G with $$|G| \ge 4k$$ | G | ≥ 4 k and minimum Ore-degree at least $$6k-1$$ 6 k - 1 contains k vertex-disjoint chorded cycles. We refine this result, characterizing the graphs G with $$|G| \ge 4k$$ | G | ≥ 4 k and minimum Ore-degree at least $$6k-2$$ 6 k - 2 that do not have k vertex-disjoint chorded cycles.