Covering a graph with cycles of length at least 4 (Q1753038)

Summary: Let \(G\) be a graph of order \(n\geq 4k\), where \(k\) is a positive integer. Suppose that the minimum degree of \(G\) is at least \(\lceil n/2\rceil\). We show that \(G\) contains \(k\) vertex-disjoint cycles covering all the vertices of \(G\) such that \(k-1\) of them are quadrilaterals.