Packing the cartesian product of two complete graphs with hexagons

Authors

  • Fu, Hung-Lin
  • Huang, Ming-Hway

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.

Published

2005-05-09

How to Cite

Fu, Hung-Lin, & Huang, Ming-Hway. (2005). Packing the cartesian product of two complete graphs with hexagons. Utilitas Mathematica, 67. Retrieved from https://utilitasmathematica.com/index.php/Index/article/view/368

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.