Contents

Ars Combinatoria

  • Research article

The \(2\)-Packing Number of Complete Grid Graphs

David C.Fisher1
1Department of Mathematics University of Colorado at Denver Denver, CO 80217-3364, U.S.A.
  • Published: 31/12/1993

Abstract

Hare and Hare conjectured the 2-packing number of an \(m \times n\) grid graph to be \(\left\lceil \frac{mn}{5} \right\rceil\) for \(m, n \geq 9\). This is verified by finding the 2-packing number for grid graphs of all sizes.

Information
Guidelines
CP Initiatives
Follow CP
Facebook X-twitter Linkedin

1970-2025 CP (Manitoba, Canada) unless otherwise stated.

Citation
David C.Fisher. The \(2\)-Packing Number of Complete Grid Graphs[J], Ars Combinatoria, Volume 036. 261-270. DOI: .