Covering the vertices of a graph with cycles of bounded length

Let c k ( G ) be the minimum number of elementary cycles of length at most k necessary to cover the vertices of a given graph G . In this work, we bound c k ( G ) by a function of the order of G and its independence number.