Packings and Coverings of the Complete Bipartite Graph by Octagons

Abstract

Let K m,n and C 8 denote the complete bipartite graph with partite sets of cardinalities m and n and octagon, respectively. We give the necessary and sufficient conditions for the existence of a C 8 -decomposition of K m,n , maximum C 8 -packings and minimum C 8 -coverings of K m,n .