Maximum packings with odd cycles
A partial \(k\)-cycle decomposition, also known as packing, of a graph \(G\) is a partial partition of the edges of \(G\) into edge disjoint \(k\)-cycles. A maximum packing is a packing with the minimum number of edges that are not used in the packing. The author obtains a maximum \(k\)-cycle packing of \(K_{2kg}+ v\) when \(k\) is odd, \(g\) a positive integer and \(v\) even.
scientific article; zbMATH DE number 626351