Packing the Complete Bipartite Graph with Hexagons

摘要

Let K_(m,n) denote the complete bipartite graph on m+n vertices with partite sets of cardinalities m and n. We give necessary and sufficient conditions for the existence of a 6-cycle packing of K_(m,n).