Packing the cartesian product of two complete graphs with hexagons

Hung-Lin Fu*, Ming Hway Huang

*Corresponding author for this work

Research output: Contribution to journalArticle

Abstract

In this paper, we completely solve the problem of finding a maximum packing of Km × Kn, the cartesian product of two complete graphs with edge-disjoint 6-cycles, and minimum leaves are explicitly given. Subsequently, we also find a minimum covering of Km × K n.

Original languageEnglish
Pages (from-to)129-140
Number of pages12
JournalUtilitas Mathematica
Volume67
StatePublished - 1 May 2005

Fingerprint Dive into the research topics of 'Packing the cartesian product of two complete graphs with hexagons'. Together they form a unique fingerprint.

  • Cite this