Square packings and coverings of the cartesian product of two complete graphs

Authors

  • Graham, Alasdair J
  • Pike, David A.

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.

Published

2005-06-09

How to Cite

Graham, Alasdair J, & Pike, David A. (2005). Square packings and coverings of the cartesian product of two complete graphs. Utilitas Mathematica, 68. Retrieved from https://utilitasmathematica.com/index.php/Index/article/view/352

Issue

Section

Articles

Citation Check

Most read articles by the same author(s)

Obs.: This plugin requires at least one statistics/report plugin to be enabled. If your statistics plugins provide more than one metric then please also select a main metric on the admin's site settings page and/or on the journal manager's settings pages.