Square packings and coverings of the cartesian product of two complete graphs
Abstract
We investigate maximum packings (resp. minimum coverings) of Km × Kn, the cartesian product of two complete graphs of order m arid n, with cycles of length 4. In so doing, we establish a minimum leave (resp. minimum padding) that is attainable with a maximum square packing (resp. minimum square covering) of Km × Kn, for each (m, n) pair.











