Kennedy, Janie Ailor Minimum coverings of \(K_ n\) with hexagons. (English) Zbl 0879.05056 Australas. J. Comb. 16, 295-303 (1997). It is known that the complete graph \(K_n\) can be decomposed into 6-cycles if and only if \(n\) is congruent to 1 or 9 modulo 12. The author completely settles the problem of the minimum number of edges that need to be added to \(K_n\) so that the resulting multigraph can be decomposed into 6-cycles. Reviewer: B.Alspach (Burnaby) Cited in 8 Documents MSC: 05C70 Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) 05C38 Paths and cycles 05C35 Extremal problems in graph theory Keywords:coverings; minimum coverings; hexagons PDF BibTeX XML Cite \textit{J. A. Kennedy}, Australas. J. Comb. 16, 295--303 (1997; Zbl 0879.05056)