We call a cycle whose length is at most \(5\) a short cycle. In this paper, we consider the packing of short cycles in a graph with specified edges. A minimum degree condition is obtained, which is slightly weaker than that of the result in \([1]\).
Citation
Hajime Matsumura. Vertex-Disjoint Short Cycles Containing Specified Edges in a Graph[J], Ars Combinatoria, Volume 080. 147-152. .
