Maximum packings with odd cycles
type: Item
instance of: scholarly article
title: Maximum packings with odd cycles
zbMATH Open document ID: 0806.05055
DOI: 10.1016/0012-365X(94)90375-1
author: S. I. El-Zanati
published in: Discrete Mathematics
publication date: 1994-08-29T00:00:00Z
review text: 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.
Mathematics Subject Classification ID: 05C70
Mathematics Subject Classification ID: 05C38
zbMATH DE Number: 626351
zbMATH Keywords: odd cycle systems
zbMATH Keywords: decomposition
zbMATH Keywords: packing
MaRDI profile type: Publication
cites work: Decomposing Complete Graphs Into Cycles of Length 2P
cites work: Q3872478
cites work: On the construction of odd cycle systems
cites work: Q4206774
cites work: Q5345646
cites work: Q5525915
cites work: On the cyclic decompositions of the complete graph into polygons with odd number of edges
cites work: Packing pentagons into complete graphs: How clumsy can you get?
cites work: Q5522938
cites work: Decomposition of K//(m,n)(K*//(m,n)) into cycles (circuits) of length 2k
cites work: Q3966151
description: scientific article; zbMATH DE number 626351