6-cycle decompositions of the cartesian product of two complete graphs

Authors

  • Farrell, Kelda A.
  • Pike, David A.

Abstract

We establish necessary and sufficient conditions on m and n for Km × Kn, the cartesian product of two complete graphs, to be decomposable into cycles of length 6.

Published

2003-05-09

How to Cite

Farrell, Kelda A., & Pike, David A. (2003). 6-cycle decompositions of the cartesian product of two complete graphs. Utilitas Mathematica, 63. Retrieved from https://utilitasmathematica.com/index.php/Index/article/view/309

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.