Packings and Coverings of the Complete Bipartite Graph by Octagons

AbstractLet Km,n and C8 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 C8-decomposition of Km,n, maximum C8-packings and minimum C8-coverings of Km,n.