Packing the Cartesian product of two complete graphs with hexagons

Abstract

In this paper, we completely solve the problem of finding a maximum packing of K-m x K-n the cartesian product of two complete graphs with edge-disjoint 6-cycles, and minimum leaves are explicitly given. Subsequently, we also find a minimum covering of K-m x K-n.