Maximum Hexagon Packing of \(K_v – L\) Where \(L\) is a \(2\)-Regular Subgraph

Abstract

In this paper, we extend the study on packing complete graphs \(K_v\) with \(6\)-cycles. Mainly, we obtain the maximum packing of \(K_v – L\) and a leave, where \(L\) is a vertex-disjoint union of cycles in \(K_v\).