Cycles in Graphs with Prescribed Stability Number and Connectivity

D. Amar, I. Fournier, A. Germa, R. Haggkvist, and C. Thomassen conjectured that the vertices of a k-connected graph with stability number α can be covered by ⌈α/k⌉ cycles. We prove this conjecture.