Article ID Journal Published Year Pages File Type
4647995 Discrete Mathematics 2013 6 Pages PDF
Abstract
The result can also be interpreted in terms of packing rectangles into a torus. The maximum number of p-by-k rectangles that can be packed into a two-dimensional m-by-n (rectangular) torus is obtained. The proof of the main theorem can be used to determine the maximum packing itself (or the corresponding largest independent set in the product graph).
Keywords
Related Topics
Physical Sciences and Engineering Mathematics Discrete Mathematics and Combinatorics
Preview
On the independence number of the strong product of cycle-powers
Authors
, ,